Skip to content
conftrace_

Papers (including subtopics)

Double Auctions with Two-sided Bandit Feedback NeurIPS 2023 Double Doubly Robust Thompson Sampling for Generalized Linear Contextual Bandits AAAI 2023 Double Randomized Underdamped Langevin with Dimension-Independent Convergence Guarantee NeurIPS 2023 Doubly Adversarial Federated Bandits ICML 2023 Doubly Fair Dynamic Pricing AISTATS 2023 Doubly Optimal No-Regret Learning in Monotone Games ICML 2023 Doubly Robust Stein-Kernelized Monte Carlo Estimator: Simultaneous Bias-Variance Reduction and Supercanonical Convergence JMLR 2023 DRCFS: Doubly Robust Causal Feature Selection ICML 2023 Dynamical Linear Bandits ICML 2023 Dynamic Constrained Submodular Optimization with Polylogarithmic Update Time ICML 2023 Dynamic Flows on Curved Space Generated by Labeled Data IJCAI 2023 Dynamic Non-monotone Submodular Maximization NeurIPS 2023 Dynamic Pricing and Learning with Bayesian Persuasion NeurIPS 2023 Dynamic Pricing with Volume Discounts in Online Settings AAAI 2023 Dynamic Ranking with the BTL Model: A Nearest Neighbor based Rank Centrality Method JMLR 2023 Echo of Neighbors: Privacy Amplification for Personalized Private Federated Learning with Shuffle Model AAAI 2023 Editable Image Geometric Abstraction via Neural Primitive Assembly ICCV 2023 Efficient Algorithms for Generalized Linear Bandits with Heavy-tailed Rewards NeurIPS 2023 Efficient Algorithms for Recognizing Weighted Tree-Adjoining Languages EMNLP 2023 Efficient Algorithms for Regret Minimization in Billboard Advertisement (Student Abstract) AAAI 2023 Efficient and Equitable Deployment of Mobile Vaccine Distribution Centers IJCAI 2023 Efficient Batched Algorithm for Contextual Linear Bandits with Large Action Space via Soft Elimination NeurIPS 2023 Efficient Convex Optimization Requires Superlinear Memory (Extended Abstract) IJCAI 2023 Efficient Discrete Multi Marginal Optimal Transport Regularization ICLR 2023 Efficient displacement convex optimization with particle gradient descent ICML 2023