Useful Links
Statistics
Computational Statistics
1. Foundations of Computational Statistics
2. Monte Carlo Methods
3. Resampling Methods
4. Numerical Optimization in Statistics
5. Bayesian Computational Methods
6. High-Dimensional Data Analysis
7. Advanced Computational Topics
High-Dimensional Data Analysis
The Curse of Dimensionality
Effects on Distance Metrics
Concentration of Distances
Nearest Neighbor Problems
Sparsity of Data
Empty Space Phenomenon
Sample Size Requirements
Overfitting Risks
Model Complexity
Generalization Error
Regularization Methods for Regression
Ridge Regression (L2 Penalty)
Shrinkage of Coefficients
Bias-Variance Tradeoff
Geometric Interpretation
Lasso (L1 Penalty)
Variable Selection
Sparse Solutions
Solution Path
Elastic Net
Combination of L1 and L2 Penalties
Tuning Parameter Selection
Grouped Variable Selection
Other Penalty Methods
SCAD Penalty
Adaptive Lasso
Group Lasso
Dimensionality Reduction
Principal Component Analysis (PCA)
Eigenvalue Decomposition
Singular Value Decomposition Approach
Scree Plots
Interpreting Principal Components
Kernel PCA
Independent Component Analysis (ICA)
Non-Gaussian Components
FastICA Algorithm
Multidimensional Scaling (MDS)
Distance Matrices
Metric and Non-metric MDS
Classical MDS
Factor Analysis
Latent Variable Models
Factor Rotation
Maximum Likelihood Estimation
t-SNE and UMAP
Non-linear Dimensionality Reduction
Neighborhood Preservation
Computation for Large Datasets
Subsampling and Data Sketching
Random Sampling
Sketching Algorithms
Count-Min Sketch
Bloom Filters
Online Algorithms
Incremental Learning
Streaming Data Processing
Stochastic Approximation
Parallel and Distributed Computing
MapReduce Paradigm
Implementations
Apache Spark
Dask
Ray
Load Balancing and Fault Tolerance
Communication Overhead
Previous
5. Bayesian Computational Methods
Go to top
Next
7. Advanced Computational Topics