JMLR 2020

162 papers
The 2020 edition of the Journal of Machine Learning Research includes work focused on algorithmic methodology, graph theory, and optimization. One paper by Frank Hutter and Marius Lindauer establishes best practices for scientific research in neural architecture search, addressing the need for standardized evaluation and reproducibility in automated machine learning. This emphasis on methodological rigor is a central theme among the year's contributions. Additional research explores theoretical aspects of machine learning, such as graph matching using partially-correct seeds and the properties of local minima in L1-minimization for complete dictionary learning. Authors including Bin Yu, Jiaming Xu, and Liren Yu contributed to these studies, which bridge the gap between practical implementation and fundamental mathematical analysis. The collected works represent a focus on refining existing search techniques and understanding the underlying landscapes of optimization problems.

Top Research Directions

Research directions most represented by JMLR 2020 papers.

Variational Inference as an Optimization Problem 3
Overcoming the Convexity Constraint in Modern Optimization 3
Proving Statistical Consistency for Complex Estimators 2
Learning and Estimation Under Model Misspecification 2
Inferring Latent Networks from Diffusion Timestamps 2
Handling Mixed Discrete and Continuous Data Types 2
How Network Topology Governs Decentralized Learning Convergence 2
Determinantal Point Processes for Diverse Subset Selection 2
Variance Underestimation in Mean-Field Variational Inference 2
Algorithmic and Hardware Strategies for Scalable Bayesian Inference 2
Alternating Optimization for Sparse Dictionary Learning 2
Geometry Aware Preconditioning for High Dimensional Optimization 2
Mitigating Parameter Explosion in High-Dimensional Time Series 2
Unified Evaluation Frameworks for Reproducible Machine Learning 2
Breaking the Curse of Horizon in Off Policy Evaluation 2

Top Authors

AuthorPapers
George Michailidis3
Aryan Mokhtari2
Bernhard Schölkopf2
Junhong Lin2
Kamil Ciosek2
Kun Zhang2
Michael A Osborne2
Mladen Kolar2
Nathan Kallus2
Ping Li2
Volkan Cevher2
Xiaotong Yuan2
Abhradeep Guha Thakurta1
Abir De1
Abla Kammoun1
Adam Golinski1
Adam Roberts1
Adam Smith1
Akshay Krishnamurthy1
Alberto Maria Metelli1

Impactful Papers

Papers from JMLR 2020 that shaped research clusters.

Foundational

Influential

Papers

Title
Monotonic Value Function Factorisation for Deep Multi-Agent Reinforcement Learning
Monte Carlo Gradient Estimation in Machine Learning
Multiclass Anomaly Detector: the CS++ Support Vector Machine
Multi-Player Bandits: The Adversarial Case
Near-optimal Individualized Treatment Recommendations
Nesterov's Acceleration for Approximate Newton
NEVAE: A Deep Generative Model for Molecular Graphs
New Insights and Perspectives on the Natural Gradient Method
On Convergence of Distributed Approximate Newton Methods: Globalization, Sharper Bounds and Beyond
Online Sufficient Dimension Reduction Through Sliced Inverse Regression
On Stationary-Point Hitting Time and Ergodicity of Stochastic Gradient Langevin Dynamics
On the Complexity Analysis of the Primal Solutions for the Accelerated Randomized Dual Coordinate Ascent
Optimal Algorithms for Continuous Non-monotone Submodular and DR-Submodular Maximization
Optimal Bipartite Network Clustering
Optimal Convergence for Distributed Learning with Stochastic Gradient Methods and Spectral Algorithms
Perturbation Bounds for Procrustes, Classical Scaling, and Trilateration, with Applications to Manifold Learning
Practical Locally Private Heavy Hitters
Prediction regions through Inverse Regression
Probabilistic Learning on Graphs via Contextual Architectures
Probabilistic Symmetries and Invariant Neural Networks
ProtoAttend: Attention-Based Prototypical Learning
Provable Convex Co-clustering of Tensors
Provably robust estimation of modulo 1 samples of a smooth function with applications to phase unwrapping
ProxSARAH: An Efficient Algorithmic Framework for Stochastic Composite Nonconvex Optimization
Quadratic Decomposable Submodular Function Minimization: Theory and Practice
Quantile Graphical Models: a Bayesian Approach
Random Smoothing Might be Unable to Certify L∞ Robustness for High-Dimensional Images
Regression with Comparisons: Escaping the Curse of Dimensionality with Ordinal Information
Regularized Estimation of High-dimensional Factor-Augmented Vector Autoregressive (FAVAR) Models
Representation Learning for Dynamic Graphs: A Survey
Robust Asynchronous Stochastic Gradient-Push: Asymptotically Optimal and Network-Independent Performance for Strongly Convex Functions
Robust Reinforcement Learning with Bayesian Optimisation and Quadrature
Scalable Approximate MCMC Algorithms for the Horseshoe Prior
Scikit-network: Graph Analysis in Python
Self-paced Multi-view Co-training
Sequential change-point detection in high-dimensional Gaussian graphical models
Simultaneous Inference for Pairwise Graphical Models with Generalized Score Matching
Skill Rating for Multiplayer Games. Introducing Hypernode Graphs and their Spectral Theory
Sobolev Norm Learning Rates for Regularized Least-Squares Algorithms
Sparse and low-rank multivariate Hawkes processes
Sparse Projection Oblique Randomer Forests
Spectral Algorithms for Community Detection in Directed Networks
Stochastic Conditional Gradient Methods: From Convex Minimization to Submodular Maximization
Stochastic Nested Variance Reduction for Nonconvex Optimization
Successor Features Combine Elements of Model-Free and Model-based Reinforcement Learning
Switching Regression Models and Causal Inference in the Presence of Discrete Latent Variables
Target-Aware Bayesian Inference: How to Beat Optimal Conventional Estimators
Target Propagation in Recurrent Neural Networks
Tensor Regression Networks
Tensor Train Decomposition on TensorFlow (T3F)

« prev Page 3/4 next »