Skip to content
conftrace_

Optimization

17,731 papers

18
117
350
1,385
2,825
'5
'10
'15
'20
'25

Papers

Non-delusional Q-learning and value-iteration NeurIPS 2018 Nonlinear Structured Signal Estimation in High Dimensions via Iterative Hard Thresholding AISTATS 2018 Non-monotone Submodular Maximization in Exponentially Fewer Iterations NeurIPS 2018 Non-parametric estimation of Jensen-Shannon Divergence in Generative Adversarial Network training AISTATS 2018 Nonrigid Points Alignment with Soft-weighted Selection IJCAI 2018 Not All Samples Are Created Equal: Deep Learning with Importance Sampling ICML 2018 Novel Algorithms for Abstract Dialectical Frameworks based on Complexity Analysis of Subclasses and SAT Solving IJCAI 2018 Objective Function Learning to Match Human Judgements for Optimization-Based Summarization NAACL 2018 On Acceleration with Noise-Corrupted Gradients ICML 2018 On denoising modulo 1 samples of a function AISTATS 2018 On Faster Convergence of Cyclic Block Coordinate Descent-type Methods for Strongly Convex Minimization JMLR 2018 On Fast Leverage Score Sampling and Optimal Learning NeurIPS 2018 Online Adaptive Methods, Universality and Acceleration NeurIPS 2018 Online Continuous-Time Tensor Factorization Based on Pairwise Interactive Point Processes IJCAI 2018 Online convex optimization for cumulative constraints NeurIPS 2018 Online Convolutional Sparse Coding with Sample-Dependent Dictionary ICML 2018 Online Heterogeneous Transfer Metric Learning IJCAI 2018 Online Improper Learning with an Approximation Oracle NeurIPS 2018 Online Kernel Selection via Incremental Sketched Kernel Alignment IJCAI 2018 Online learning over a finite action set with limited switching COLT 2018 Online Learning Rate Adaptation with Hypergradient Descent ICLR 2018 Online Learning with Non-Convex Losses and Non-Stationary Regret AISTATS 2018 Online Linear Quadratic Control ICML 2018 Online Pricing for Revenue Maximization with Unknown Time Discounting Valuations IJCAI 2018 On Markov Chain Gradient Descent NeurIPS 2018