JMLR 2017 papers on Learning theory and algorithms
58 of the 147 papers published in JMLR 2017 (39.5%) are on Learning theory and algorithms, compared with 40.2% at JMLR 2016. They fall into 8 topics.
See JMLR 2017 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 · 18 papers
- Communication-efficient Sparse Regression (136 citations)
- STORE: Sparse Tensor Response Regression and Neuroimaging Analysis (71 citations)
- Fundamental Conditions for Low-CP-Rank Tensor Completion (54 citations)
- Gap Safe Screening Rules for Sparsity Enforcing Penalties (52 citations)
- Matrix Completion with Noisy Entries and Outliers (32 citations)
- On Computationally Tractable Selection of Experiments in Measurement-Constrained Regression Models (32 citations)
- Learning Local Dependence In Ordered Data (27 citations)
- Sharp Oracle Inequalities for Square Root Regularization (23 citations)
- Quantifying the Informativeness of Similarity Measurements (21 citations)
- Generalized SURE for optimal shrinkage of singular values in low-rank matrix denoising (16 citations)
- Two New Approaches to Compressed Sensing Exhibiting Both Robust Sparse Recovery and the Grouping Effect (14 citations)
- Rank Determination for Low-Rank Data Completion (13 citations)
and 6 more in the interactive map.
Kernels and regression theory · 12 papers
- On the Equivalence between Kernel Quadrature Rules and Random Feature Expansions (183 citations)
- Distributed Learning with Regularized Least Squares (138 citations)
- Distributed Semi-supervised Learning with Kernel Ridge Regression (84 citations)
- Empirical Evaluation of Resampling Procedures for Optimising SVM Hyperparameters (40 citations)
- Learning Theory of Distributed Regression with Bias Corrected Regularization Kernel Network (36 citations)
- Asymptotic behavior of Support Vector Machine for spiked population model (24 citations)
- Hierarchically Compositional Kernels for Scalable Nonparametric Learning (17 citations)
- Approximation Vector Machines for Large-scale Online Learning (15 citations)
- Minimax Estimation of Kernel Mean Embeddings (13 citations)
- Tests of Mutual or Serial Independence of Random Vectors with Applications (12 citations)
- Kernel Partial Least Squares for Stationary Data (6 citations)
- Time-Accuracy Tradeoffs in Kernel Prediction: Controlling Prediction Quality (3 citations)
Sample complexity · 9 papers
- JSAT: Java Statistical Analysis Tool, a Library for Machine Learning (50 citations)
- Computational Limits of A Distributed Algorithm for Smoothing Spline (44 citations)
- Regularization and the small-ball method II: complexity dependent error rates (24 citations)
- Preference-based Teaching (21 citations)
- Asymptotic Analysis of Objectives Based on Fisher Information in Active Learning (18 citations)
- Nearly optimal classification for semimetrics (5 citations)
- Optimal Dictionary for Least Squares Representation (5 citations)
- Efficient Sampling from Time-Varying Log-Concave Distributions
- Dimension Estimation Using Random Connection Models
Clustering · 8 papers
- Achieving Optimal Misclassification Proportion in Stochastic Block Models (147 citations)
- The Impact of Random Models on Clustering Similarity (94 citations)
- Uniform Hypergraph Partitioning: Provable Tensor Methods and Sampling Techniques (41 citations)
- Robust Discriminative Clustering with Sparse Regularizers (13 citations)
- Clustering with Hidden Markov Model on Variable Blocks (8 citations)
- Consistency, Breakdown Robustness, and Algorithms for Robust Improper Maximum Likelihood Clustering
- Local algorithms for interactive clustering
- Spectral Clustering Based on Local PCA
Prediction and decision losses · 6 papers
- Explaining the Success of AdaBoost and Random Forests as Interpolating Classifiers (253 citations)
- Making Decision Trees Feasible in Ultrahigh Feature and Label Dimensions (78 citations)
- A Bayesian Framework for Learning Rule Sets for Interpretable Classification (10 citations)
- Identifying a Minimal Class of Models for High--dimensional Data (10 citations)
- Target Curricula via Selection of Minimum Feature Sets: a Case Study in Boolean Networks (4 citations)
- On the Consistency of Ordinal Regression Methods
Submodular and game algorithms · 2 papers
Combinatorial and search optimization · 2 papers
Optimal transport · 1 paper
- Multiscale Strategies for Computing Optimal Transport (27 citations)
