Skip to content
conftrace_

Papers (including subtopics)

Gradient Hard Thresholding Pursuit JMLR 2018 Graph-Cut RANSAC CVPR 2018 Graphical model inference: Sequential Monte Carlo meets deterministic approximations NeurIPS 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-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 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 IHT dies hard: Provable accelerated Iterative Hard Thresholding AISTATS 2018 Implicit Probabilistic Integrators for ODEs NeurIPS 2018 Improved Asynchronous Parallel Optimization Analysis for Stochastic Incremental Methods JMLR 2018 Improved Epoch Extraction from Telephonic Speech Using Chebfun and Zero Frequency Filtering Interspeech 2018 Improved large-scale graph learning through ridge spectral sparsification ICML 2018 Improved Regret Bounds for Thompson Sampling in Linear Quadratic Control Problems ICML 2018 Improving Coverage and Runtime Complexity for Exact Inference in Non-Projective Transition-Based Dependency Parsers NAACL 2018