Mathematics & Optimization

Learning to Price Against a Moving Target ICML 2021 Learning to Schedule Heuristics in Branch and Bound NeurIPS 2021 Learning to Select Exogenous Events for Marked Temporal Point Process NeurIPS 2021 Learning to Stop with Surprisingly Few Samples COLT 2021 Learning with Comparison Feedback: Online Estimation of Sample Statistics ALT 2021 Learning Within an Instance for Designing High-Revenue Combinatorial Auctions IJCAI 2021 Learning with semi-definite programming: statistical bounds based on fixed point analysis and excess risk curvature JMLR 2021 Learning with User-Level Privacy NeurIPS 2021 Lenient Regret and Good-Action Identification in Gaussian Process Bandits ICML 2021 Lenient Regret for Multi-Armed Bandits AAAI 2021 Leveraging Good Representations in Linear Contextual Bandits ICML 2021 Leveraging probabilistic circuits for nonparametric multi-output regression UAI 2021 Leveraging Spatial and Temporal Correlations in Sparsified Mean Estimation NeurIPS 2021 Leveraging the Uniformity Framework to Examine Crosslinguistic Similarity for Long-Lag Stops in Spontaneous Cantonese-English Bilingual Speech Interspeech 2021 LightGuardian: A Full-Visibility, Lightweight, In-band Telemetry System Using Sketchlets NSDI 2021 Light RUMs ICML 2021 Limit theorems for out-of-sample extensions of the adjacency and Laplacian spectral embeddings JMLR 2021 Linear Bandits on Uniformly Convex Sets JMLR 2021 Linear Convergent Decentralized Optimization with Compression ICLR 2021 Linear Last-iterate Convergence in Constrained Saddle-point Optimization ICLR 2021 Linearly Constrained Gaussian Processes with Boundary Conditions AISTATS 2021 Linear Models are Robust Optimal Under Strategic Behavior AISTATS 2021 Linear Regression over Networks with Communication Guarantees L4DC 2021 Linear-Time Probabilistic Solution of Boundary Value Problems NeurIPS 2021 Linguistic Dependencies and Statistical Dependence EMNLP 2021