Skip to content
conftrace_

Mathematics & Optimization

19,283 papers (0 classified directly here)

1
24
182
599
1,739
1,785
2000
'5
'10
'15
'20
'25

Papers (including subtopics)

Pure Exploration and Regret Minimization in Matching Bandits ICML 2021 Q-Match: Iterative Shape Matching via Quantum Annealing ICCV 2021 Quantifying and Reducing Bias in Maximum Likelihood Estimation of Structured Anomalies ICML 2021 Quantifying Variational Approximation for Log-Partition Function COLT 2021 Quantile Bandits for Best Arms Identification ICML 2021 Quantization Algorithms for Random Fourier Features ICML 2021 Quantum Exploration Algorithms for Multi-Armed Bandits AAAI 2021 Quantum Permutation Synchronization CVPR 2021 Quantum Tensor Networks, Stochastic Processes, and Weighted Automata AISTATS 2021 Quasi-Monte Carlo Quasi-Newton in Variational Bayes JMLR 2021 Quick Streaming Algorithms for Maximization of Monotone Submodular Functions in Linear Time AISTATS 2021 Random Coordinate Langevin Monte Carlo COLT 2021 Random Coordinate Underdamped Langevin Monte Carlo AISTATS 2021 Random Graph Matching with Improved Noise Robustness COLT 2021 Randomized Algorithms for Submodular Function Maximization with a k-System Constraint ICML 2021 Randomized Dimensionality Reduction for Facility Location and Single-Linkage Clustering ICML 2021 Random Shuffling Beats SGD Only After Many Epochs on Ill-Conditioned Problems NeurIPS 2021 Ranking and synchronization from pairwise measurements via SVD JMLR 2021 Ranking Extensions in Abstract Argumentation IJCAI 2021 Rank-one matrix estimation: analytic time evolution of gradient descent dynamics COLT 2021 Rank-One Prior: Toward Real-Time Scene Recovery CVPR 2021 Rank Overspecified Robust Matrix Recovery: Subgradient Method and Exact Recovery NeurIPS 2021 Rao-Blackwellised parallel MCMC AISTATS 2021 Rate-Distortion Analysis of Minimum Excess Risk in Bayesian Learning ICML 2021 Rate-improved inexact augmented Lagrangian method for constrained nonconvex optimization AISTATS 2021