Skip to content
conftrace_

Optimization

17,731 papers

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

Papers

Towards Efficient Selection of Activity Trajectories based on Diversity and Coverage AAAI 2021 Towards Efficient Tensor Decomposition-Based DNN Model Compression With Optimization Framework CVPR 2021 Towards Evaluating and Training Verifiably Robust Neural Networks CVPR 2021 Towards Flexible Device Participation in Federated Learning AISTATS 2021 Towards Generalized Implementation of Wasserstein Distance in GANs AAAI 2021 Towards Gradient-based Bilevel Optimization with Non-convex Followers and Beyond NeurIPS 2021 Towards Impartial Multi-task Learning ICLR 2021 Towards Improving the Consistency, Efficiency, and Flexibility of Differentiable Neural Architecture Search CVPR 2021 Towards Mixed-Precision Quantization of Neural Networks via Constrained Optimization ICCV 2021 Towards More Practical and Efficient Automatic Dominance Breaking AAAI 2021 Towards Resolving the Implicit Bias of Gradient Descent for Matrix Factorization: Greedy Low-Rank Learning ICLR 2021 Towards Robust Dynamic Network Embedding IJCAI 2021 Towards Robust Model Reuse in the Presence of Latent Domains IJCAI 2021 Towards Sample-Optimal Compressive Phase Retrieval with Sparse and Generative Priors NeurIPS 2021 Towards Scalable Complete Verification of Relu Neural Networks via Dependency-based Branching IJCAI 2021 Towards Stable and Robust AdderNets NeurIPS 2021 Towards Tight Communication Lower Bounds for Distributed Optimisation NeurIPS 2021 Towards tractable optimism in model-based reinforcement learning UAI 2021 Towards Understanding the Behaviors of Optimal Deep Active Learning Algorithms AISTATS 2021 Towards Understanding Why Lookahead Generalizes Better Than SGD and Beyond NeurIPS 2021 Tracking Regret Bounds for Online Submodular Optimization AISTATS 2021 Tractable Regularization of Probabilistic Circuits NeurIPS 2021 Tractable structured natural-gradient descent using local parameterizations ICML 2021 Tradeoffs in Data Augmentation: An Empirical Study ICLR 2021 Training Certifiably Robust Neural Networks with Efficient Local Lipschitz Bounds NeurIPS 2021