JMLR 2018 papers on Learning theory and algorithms
72 of the 164 papers published in JMLR 2018 (43.9%) are on Learning theory and algorithms, compared with 39.5% at JMLR 2017. They fall into 8 topics.
See JMLR 2018 in the interactive map
Working on something in this area? Describe your idea in scime atlas to see the closest papers by meaning and how crowded the spot has become.
Topics and papers
Matrix and tensor methods · 20 papers
- A Tight Bound of Hard Thresholding (64 citations)
- Gradient Hard Thresholding Pursuit (63 citations)
- Convergence Analysis of Distributed Inference with Vector-Valued Gaussian Belief Propagation (57 citations)
- A Constructive Approach to $L_0$ Penalized Regression (38 citations)
- A Direct Approach for Sparse Quadratic Discriminant Analysis (36 citations)
- Robust PCA by Manifold Optimization (34 citations)
- Using Side Information to Reliably Learn Low-Rank Matrices from Missing and Corrupted Observations (27 citations)
- Modular Proximal Optimization for Multidimensional Total-Variation Regularization (23 citations)
- Harmonic Mean Iteratively Reweighted Least Squares for Low-Rank Matrix Recovery (17 citations)
- The Search Problem in Mixture Models (9 citations)
- Local Identifiability of $\ell_1$-minimization Dictionary Learning: a Sufficient and Almost Necessary Condition (8 citations)
- Reverse Iterative Volume Sampling for Linear Regression (8 citations)
and 8 more in the interactive map.
Prediction and decision losses · 15 papers
- To Tune or Not to Tune the Number of Trees in Random Forest (435 citations)
- Learning Certifiably Optimal Rule Lists for Categorical Data (172 citations)
- Random Forests, Decision Trees, and Categorical Predictors: The "Absent Levels" Problem (49 citations)
- Sparse Concordance-assisted Learning for Optimal Treatment Decision (34 citations)
- Learning from Comparisons and Choices (25 citations)
- Simple Classification Using Binary Data (24 citations)
- A New and Flexible Approach to the Analysis of Paired Comparison Data (9 citations)
- Hinge-Minimax Learner for the Ensemble of Hyperplanes (5 citations)
- A Robust Learning Approach for Regression Models Based on Distributionally Robust Optimization
- Automatic Differentiation in Machine Learning: a Survey
- DALEX: Explainers for Complex Predictive Models in R
- From Predictive Methods to Missing Data Imputation: An Optimization Approach
and 3 more in the interactive map.
Sample complexity · 13 papers
- Training Gaussian Mixture Models at Scale via Coresets (64 citations)
- Optimal Quantum Sample Complexity of Learning Algorithms (52 citations)
- Fast MCMC Sampling Algorithms on Polytopes (49 citations)
- Distribution-Specific Hardness of Learning Neural Networks (46 citations)
- Kernel Density Estimation for Dynamical Systems (18 citations)
- HyperTools: a Python Toolbox for Gaining Geometric Insights into High-Dimensional Data (16 citations)
- Gaussian Lower Bound for the Information Bottleneck Limit (10 citations)
- Maximum Selection and Sorting with Adversarial Comparators (10 citations)
- Goodness-of-Fit Tests for Random Partitions via Symmetric Polynomials (4 citations)
- Interactive Algorithms: Pool, Stream and Precognitive Stream (3 citations)
- Rate of Convergence of $k$-Nearest-Neighbor Classification Rule
- Robust Topological Inference: Distance To a Measure and Kernel Distance
and 1 more in the interactive map.
Kernels and regression theory · 11 papers
- Kernel Distribution Embeddings: Universal Kernels, Characteristic Kernels and Kernel Metrics on Distributions (65 citations)
- Kernel Method for Persistence Diagrams via Kernel Embedding and Weight Factor (55 citations)
- KELP: a Kernel-based Learning Platform (51 citations)
- Characteristic and Universal Tensor Product Kernels (43 citations)
- Parallelizing Spectrally Regularized Kernel Algorithms (31 citations)
- Streaming kernel regression with provably adaptive mean, variance, and regularization (29 citations)
- Accelerating Cross-Validation in Multinomial Logistic Regression with $\ell_1$-Regularization (7 citations)
- Optimal Bounds for Johnson-Lindenstrauss Transformations (5 citations)
- On Tight Bounds for the Lasso (3 citations)
- Can We Trust the Bootstrap in High-dimensions? The Case of Linear Models
- Divide-and-Conquer for Debiased $l_1$-norm Support Vector Machine in Ultra-high Dimensions
Clustering · 6 papers
- Community Detection and Stochastic Block Models: Recent Developments (453 citations)
- Simultaneous Clustering and Estimation of Heterogeneous Graphical Models (78 citations)
- OpenEnsembles: A Python Resource for Ensemble Clustering (42 citations)
- A Cluster Elastic Net for Multivariate Regression (15 citations)
- An Efficient and Effective Generic Agglomerative Hierarchical Clustering Approach (13 citations)
- Clustering is semidefinitely not that hard: Nonnegative SDP for manifold disentangling (9 citations)
Combinatorial and search optimization · 5 papers
- tick: a Python Library for Statistical Learning, with an emphasis on Hawkes Processes and Time-Dependent Models (84 citations)
- Short-term Sparse Portfolio Optimization Based on Alternating Direction Method of Multipliers (31 citations)
- A Spectral Approach for the Design of Experiments: Design, Analysis and Algorithms (28 citations)
- Exact Learning of Lightweight Description Logic Ontologies (21 citations)
- The xyz algorithm for fast interaction search in high-dimensional data (12 citations)
Submodular and game algorithms · 1 paper
Optimal transport · 1 paper
- Regularized Optimal Transport and the Rot Mover's Distance (57 citations)
