Skip to content
conftrace_

Papers (including subtopics)

On the Riemannian Search for Eigenvector Computation JMLR 2021 On the Second-order Convergence Properties of Random Search Methods NeurIPS 2021 On The Structure of Parametric Tournaments with Application to Ranking from Pairwise Comparisons NeurIPS 2021 On the Verification of Neural ODEs with Stochastic Guarantees AAAI 2021 On Uninformative Optimal Policies in Adaptive LQR with Unknown B-Matrix L4DC 2021 On Universal Approximation and Error Bounds for Fourier Neural Operators JMLR 2021 OpEvo: An Evolutionary Method for Tensor Operator Optimization AAAI 2021 Optimal Algorithms for Range Searching over Multi-Armed Bandits IJCAI 2021 Optimal Algorithms for Stochastic Contextual Preference Bandits NeurIPS 2021 Optimal Algorithms for Submodular Maximization with Distributed Constraints L4DC 2021 Optimal Cost Design for Model Predictive Control L4DC 2021 Optimal Counterfactual Explanations in Tree Ensembles ICML 2021 Optimal Decision Trees for Nonlinear Metrics AAAI 2021 Optimal dimension dependence of the Metropolis-Adjusted Langevin Algorithm COLT 2021 Optimal Dynamic Regret in Exp-Concave Online Learning COLT 2021 Optimal Estimation of High Dimensional Smooth Additive Function Based on Noisy Observations ICML 2021 Optimal Feedback Law Recovery by Gradient-Augmented Sparse Polynomial Regression JMLR 2021 Optimal Gradient-based Algorithms for Non-concave Bandit Optimization NeurIPS 2021 Optimality and Stability in Federated Learning: A Game-theoretic Approach NeurIPS 2021 Optimal Kidney Exchange with Immunosuppressants AAAI 2021 Optimal Non-Convex Exact Recovery in Stochastic Block Model via Projected Power Method ICML 2021 Optimal Order Simple Regret for Gaussian Process Bandits NeurIPS 2021 Optimal Pose and Shape Estimation for Category-level 3D Object Perception RSS 2021 Optimal Quantisation of Probability Measures Using Maximum Mean Discrepancy AISTATS 2021 Optimal Quantization Using Scaled Codebook CVPR 2021