Mathematics & Optimization
19,283 papers (0 classified directly here)
Subtopics · a paper can sit in several, so these overlap
Papers per year
1
2
8
13
8
24
100
100
125
139
182
227
311
530
574
599
676
880
1,053
1,491
1,739
1,880
1,904
2,070
2,345
1,785
517
2000
'5
'10
'15
'20
'25
Papers (including subtopics)
On the interplay between noise and curvature and its effect on optimization and generalization
AISTATS 2020
On the (In)tractability of Computing Normalizing Constants for the Product of Determinantal Point Processes
ICML 2020
On the Max-Min Fair Stochastic Allocation of Indivisible Goods
AAAI 2020
On the Noisy Gradient Descent that Generalizes as SGD
ICML 2020
On the optimality of kernels for high-dimensional clustering
AISTATS 2020
On the Parameterized Complexity of Clustering Incomplete Data into Subspaces of Small Rank
AAAI 2020
On the Power of Compressed Sensing with Generative Models
ICML 2020
On the Power of Louvain in the Stochastic Block Model
NeurIPS 2020
On the Problem of Covering a 3-D Terrain
AAAI 2020
On the Relationship Between Probabilistic Circuits and Determinantal Point Processes
UAI 2020
On the Robustness of Data-Driven Controllers for Linear Systems
L4DC 2020
On the Role of Sparsity and DAG Constraints for Learning Linear DAGs
NeurIPS 2020
On the Similarity between the Laplace and Neural Tangent Kernels
NeurIPS 2020
On the Splitting Property for Epistemic Logic Programs (Extended Abstract)
IJCAI 2020
On the Theoretical Guarantees for Parameter Estimation of Gaussian Random Field Models: A Sparse Precision Matrix Approach
JMLR 2020
On the Theoretical Properties of the Network Jackknife
ICML 2020
On the Unreasonable Effectiveness of the Greedy Algorithm: Greedy Adapts to Sharpness
ICML 2020
On Unbalanced Optimal Transport: An Analysis of Sinkhorn Algorithm
ICML 2020
Open Problem: Average-Case Hardness of Hypergraphic Planted Clique Detection
COLT 2020
Open Problem: Fast and Optimal Online Portfolio Selection
COLT 2020
Open Problem: Information Complexity of VC Learning
COLT 2020
Open Problem: Model Selection for Contextual Bandits
COLT 2020
Open Problem: Tight Convergence of SGD in Constant Dimension
COLT 2020
Optimal $δ$-Correct Best-Arm Selection for Heavy-Tailed Distributions
ALT 2020
Optimal Adaptive Electrode Selection to Maximize Simultaneously Recorded Neuron Yield
NeurIPS 2020