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)

Gradient Descent Learns Linear Dynamical Systems JMLR 2018 Gradient Descent Meets Shift-and-Invert Preconditioning for Eigenvector Computation NeurIPS 2018 Gradient Estimation with Simultaneous Perturbation and Compressive Sensing JMLR 2018 Gradient Hard Thresholding Pursuit JMLR 2018 Graph-Cut RANSAC CVPR 2018 Graphical model inference: Sequential Monte Carlo meets deterministic approximations NeurIPS 2018 Graphical Models for Non-Negative Data Using Generalized Score Matching AISTATS 2018 Graphical Nonconvex Optimization via an Adaptive Convex Relaxation ICML 2018 Graph Oracle Models, Lower Bounds, and Gaps for Parallel Stochastic Optimization NeurIPS 2018 Greed is Still Good: Maximizing Monotone Submodular+Supermodular (BP) Functions ICML 2018 Gromov-Wasserstein Alignment of Word Embedding Spaces EMNLP 2018 Growth-Optimal Portfolio Selection under CVaR Constraints AISTATS 2018 Harmonic Mean Iteratively Reweighted Least Squares for Low-Rank Matrix Recovery JMLR 2018 Hidden Integrality of SDP Relaxations for Sub-Gaussian Mixture Models COLT 2018 Hierarchical Clustering with Structural Constraints ICML 2018 High Dimensional Linear Regression using Lattice Basis Reduction NeurIPS 2018 High-dimensional Similarity Learning via Dual-sparse Random Projection IJCAI 2018 High-Order Co-Clustering via Strictly Orthogonal and Symmetric L1-Norm Nonnegative Matrix Tri-Factorization IJCAI 2018 High-Order Tensor Regularization With Application to Attribute Ranking CVPR 2018 High-Speed Tracking With Multi-Kernel Correlation Filters CVPR 2018 HONES: A Fast and Tuning-free Homotopy Method For Online Newton Step AISTATS 2018 Horizon-Independent Minimax Linear Regression NeurIPS 2018 Horn-Rewritability vs PTime Query Evaluation in Ontology-Mediated Querying IJCAI 2018 How Much Restricted Isometry is Needed In Nonconvex Matrix Recovery? NeurIPS 2018 How to tell when a clustering is (approximately) correct using convex relaxations NeurIPS 2018