Mathematics & Optimization

On Discovering Interesting Combinatorial Integer Sequences IJCAI 2023 On Distance and Kernel Measures of Conditional Dependence JMLR 2023 On Dynamic Programming Decompositions of Static Risk Measures in Markov Decision Processes NeurIPS 2023 One Arrow, Two Kills: A Unified Framework for Achieving Optimal Regret Guarantees in Sleeping Bandits AISTATS 2023 One Cannot Stand for Everyone! Leveraging Multiple User Simulators to train Task-oriented Dialogue Systems ACL 2023 One Model, Any CSP: Graph Neural Networks as Fast Global Search Heuristics for Constraint Satisfaction IJCAI 2023 On Error and Compression Rates for Prototype Rules AAAI 2023 One-Shot Compression of Large Edge-Exchangeable Graphs using Bits-Back Coding ICML 2023 One-sided Matrix Completion from Two Observations Per Row ICML 2023 On Excess Mass Behavior in Gaussian Mixture Models with Orlicz-Wasserstein Distances ICML 2023 On Kinetic Optimal Probability Paths for Generative Models ICML 2023 On Learning Rates and Schrödinger Operators JMLR 2023 Online Ad Allocation with Predictions NeurIPS 2023 Online Adaptive Policy Selection in Time-Varying Systems: No-Regret via Contractive Perturbations NeurIPS 2023 Online Ad Procurement in Non-stationary Autobidding Worlds NeurIPS 2023 Online Algorithms with Costly Predictions AISTATS 2023 Online Certification of Preference-Based Fairness for Personalized Recommender Systems (Extended Abstract) IJCAI 2023 Online Clustering of Bandits with Misspecified User Models NeurIPS 2023 Online Constrained Meta-Learning: Provable Guarantees for Generalization NeurIPS 2023 Online Control for Meta-optimization NeurIPS 2023 Online Convex Optimization with Unbounded Memory NeurIPS 2023 Online estimation of similarity matrices with incomplete data UAI 2023 Online Heavy-tailed Change-point detection UAI 2023 Online Hyperparameter Optimization for Class-Incremental Learning AAAI 2023 Online Inventory Problems: Beyond the i.i.d. Setting with Online Convex Optimization NeurIPS 2023