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)

Normal Integration via Inverse Plane Fitting With Minimum Point-to-Plane Distance CVPR 2021 No-substitution k-means Clustering with Adversarial Order ALT 2021 NuQClq: An Effective Local Search Algorithm for Maximum Quasi-Clique Problem AAAI 2021 Oblivious Sketching-based Central Path Method for Linear Programming ICML 2021 Oblivious Sketching for Logistic Regression ICML 2021 Offline detection of change-points in the mean for stationary graph signals. AISTATS 2021 Of Moments and Matching: A Game-Theoretic Framework for Closing the Imitation Gap ICML 2021 On a Combination of Alternating Minimization and Nesterov’s Momentum ICML 2021 On a Competitive Secretary Problem with Deferred Selections IJCAI 2021 On ADMM in Deep Learning: Convergence and Saturation-Avoidance JMLR 2021 On a Utilitarian Approach to Privacy Preserving Text Generation NAACL 2021 On Continuous Local BDD-Based Search for Hybrid SAT Solving AAAI 2021 On efficient multilevel Clustering via Wasserstein distances JMLR 2021 One for One, or All for All: Equilibria and Optimality of Collaboration in Federated Learning ICML 2021 One More Step Towards Reality: Cooperative Bandits with Imperfect Communication NeurIPS 2021 Oneshot Differentially Private Top-k Selection ICML 2021 One-Shot Federated Learning: Theoretical Limits and Algorithms to Achieve Them JMLR 2021 One-sided Frank-Wolfe algorithms for saddle problems ICML 2021 One-Sketch-for-All: Non-linear Random Features from Compressed Linear Measurements AISTATS 2021 On Estimation in Latent Variable Models ICML 2021 On Fair Division under Heterogeneous Matroid Constraints AAAI 2021 On Finding the K-best Non-projective Dependency Trees ACL 2021 On Homophony and Rényi Entropy EMNLP 2021 On Information Gain and Regret Bounds in Gaussian Process Bandits AISTATS 2021 On learning sparse vectors from mixture of responses NeurIPS 2021