NeurIPS 2016 accepted papers on Learning theory and algorithms
172 of the 570 papers accepted at NeurIPS 2016 (30.2%) are on Learning theory and algorithms. They fall into 8 topics.
See NeurIPS 2016 in the interactive map
Submitting to NeurIPS? Checklist →
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 · 45 papers
- Supervised Learning with Tensor Networks (196 citations)
- Mutual information for symmetric rank-one matrix estimation: A proof of the replica formula (125 citations)
- Sub-sampled Newton Methods with Non-uniform Sampling (82 citations)
- Low-Rank Regression with Tensor Responses (48 citations)
- High-Rank Matrix Completion and Clustering under Self-Expressive Models (44 citations)
- Blind Regression: Nonparametric Regression for Latent Variable Models via Collaborative Filtering (37 citations)
- Normalized Spectral Map Synchronization (35 citations)
- Dimensionality Reduction of Massive Sparse Datasets Using Coresets (34 citations)
- Selective inference for group-sparse linear models (34 citations)
- A Sparse Interactive Model for Matrix Completion with Side Information (32 citations)
- GAP Safe Screening Rules for Sparse-Group Lasso (32 citations)
- Sublinear Time Orthogonal Tensor Decomposition (30 citations)
and 33 more in the interactive map.
Prediction and decision losses · 39 papers
- Learning Deep Embeddings with Histogram Loss (257 citations)
- Satisfying Real-world Goals with Dataset Constraints (122 citations)
- A Communication-Efficient Parallel Algorithm for Decision Tree (69 citations)
- A Minimax Approach to Supervised Learning (56 citations)
- Finite Sample Prediction and Recovery Bounds for Ordinal Embedding (52 citations)
- Higher-Order Factorization Machines (50 citations)
- Optimal Black-Box Reductions Between Optimization Objectives (50 citations)
- Deconvolving Feedback Loops in Recommender Systems (43 citations)
- Fast Active Set Methods for Online Spike Inference from Calcium Imaging (43 citations)
- Boosting with Abstention (39 citations)
- Nested Mini-Batch K-Means (36 citations)
- A Consistent Regularization Approach for Structured Prediction (33 citations)
and 27 more in the interactive map.
Sample complexity · 31 papers
- Quantum Perceptron Models (98 citations)
- Local Maxima in the Likelihood of Gaussian Mixture Models: Structural Results and Algorithmic Consequences (95 citations)
- Global Analysis of Expectation Maximization for Mixtures of Two Gaussians (85 citations)
- Total Variation Classes Beyond 1d: Minimax Rates, and the Limitations of Linear Smoothers (47 citations)
- Interaction Screening: Efficient and Sample-Optimal Learning of Ising Models (46 citations)
- Active Learning from Imperfect Labelers (34 citations)
- Achieving the KS threshold in the general stochastic block model with linearized acyclic belief propagation (23 citations)
- Supervised learning through the lens of compression (19 citations)
- Interpretable Distribution Features with Maximum Testing Power (18 citations)
- Multivariate tests of association based on univariate tests (18 citations)
- DECOrrelated feature space partitioning for distributed sparse regression (17 citations)
- Lifelong Learning with Weighted Majority Votes (13 citations)
and 19 more in the interactive map.
Clustering · 16 papers
- Fast and accurate spike sorting of high-channel count probes with KiloSort (356 citations)
- Clustering with Same-Cluster Queries (55 citations)
- Crowdsourced Clustering: Querying Edges vs Triangles (34 citations)
- Flexible Models for Microclustering with Application to Entity Resolution (30 citations)
- Hierarchical Clustering via Spreading Metrics (28 citations)
- A Constant-Factor Bi-Criteria Approximation Guarantee for k-means++ (24 citations)
- Clustering Signed Networks with the Geometric Mean of Laplacians (22 citations)
- Anchor-Free Correlated Topic Modeling: Identifiability and Algorithm (20 citations)
- Robust k-means: a Theoretical Revisit (20 citations)
- Communication-Optimal Distributed Clustering (19 citations)
- On Robustness of Kernel Clustering (17 citations)
- General Tensor Spectral Co-clustering for Higher-Order Data (16 citations)
and 4 more in the interactive map.
Submodular and game algorithms · 15 papers
- Causal meets Submodular: Subset Selection with Directed Information (45 citations)
- Sample Complexity of Automated Mechanism Design (30 citations)
- Budgeted stream-based active learning via adaptive submodular maximization (29 citations)
- The Power of Optimization from Samples (28 citations)
- Deep Learning Games (19 citations)
- Deep Submodular Functions: Definitions and Learning (18 citations)
- Maximizing Influence in an Ising Network: A Mean-Field Optimal Solution (16 citations)
- Computing and maximizing influence in linear threshold and triggering models (10 citations)
- Learning Tree Structured Potential Games (9 citations)
- Bi-Objective Online Matching and Submodular Allocations (8 citations)
- Joint M-Best-Diverse Labelings as a Parametric Submodular Minimization (8 citations)
- An Efficient Streaming Algorithm for the Submodular Cover Problem (6 citations)
and 3 more in the interactive map.
Combinatorial and search optimization · 14 papers
- Bayesian Optimization with a Finite Budget: An Approximate Dynamic Programming Approach (56 citations)
- Simple and Efficient Weighted Minwise Hashing (33 citations)
- Multistage Campaigning in Social Networks (30 citations)
- Large-Scale Price Optimization via Network Flow (25 citations)
- SDP Relaxation with Randomized Rounding for Energy Disaggregation (22 citations)
- Assortment Optimization Under the Mallows model (16 citations)
- Pruning Random Forests for Prediction on a Budget (16 citations)
- Linear Relaxations for Finding Diverse Elements in Metric Spaces (15 citations)
- Learning from Rational Behavior: Predicting Solutions to Unknown Linear Programs (10 citations)
- A Credit Assignment Compiler for Joint Prediction (9 citations)
- Identification and Overidentification of Linear Structural Equation Models (7 citations)
- Solving Marginal MAP Problems with NP Oracles and Parity Constraints (5 citations)
and 2 more in the interactive map.
Kernels and regression theory · 11 papers
- Exponential expressivity in deep neural networks through transient chaos (290 citations)
- Orthogonal Random Features (93 citations)
- Learning Kernels with Random Features (62 citations)
- Minimax Estimation of Maximum Mean Discrepancy with Radial Kernels (61 citations)
- Convergence guarantees for kernel-based quadrature rules in misspecified settings (23 citations)
- Joint quantile regression in vector-valued RKHSs (22 citations)
- Minimax Optimal Alternating Minimization for Kernel Nonparametric Tensor Learning (10 citations)
- Greedy Feature Construction (8 citations)
- Error Analysis of Generalized Nyström Kernel Regression (4 citations)
- On Regularizing Rademacher Observation Losses (1 citation)
- Dynamic Mode Decomposition with Reproducing Kernels for Koopman Spectral Analysis
Optimal transport · 1 paper
- Mapping Estimation for Discrete Optimal Transport (60 citations)
