Skip to yearly menu bar Skip to main content


Show Detail Timezone:
America/Los_Angeles
 
Filter Rooms:  

WED 1 MAY
10:30 p.m.
(ends 8:00 AM)
11:45 p.m.
Remarks:
GC
(ends 12:00 AM)

THU 2 MAY
midnight
Invited Talk:
Matthew D. Hoffman
(ends 1:00 AM)
1 a.m.
Morning Coffee Break
1:30 a.m.
Orals -
Conformal Contextual Robust Optimization
Near-Optimal Policy Optimization for Correlated Equilibrium in General-Sum Markov Games
Model-based Policy Optimization under Approximate Bayesian Inference
Online Learning of Decision Trees with Thompson Sampling
(ends 2:30 AM)
3:30 a.m.
Lunch - retail
5 a.m.
Orals -
The sample complexity of ERMs in stochastic convex optimization
Stochastic Methods in Variational Inequalities: Ergodicity, Bias and Refinements
Absence of spurious solutions far from ground truth: A low-rank analysis with high-order losses
Learning-Based Algorithms for Graph Searching Problems
Graph Partitioning with a Move Budget
(ends 6:15 AM)
6:15 a.m.
Afternoon Coffee Break
6:45 a.m.
Orals -
Neural McKean-Vlasov Processes: Distributional Dependence in Diffusion Processes
Reparameterized Variational Rejection Sampling
Intrinsic Gaussian Vector Fields on Manifolds
Generative Flow Networks as Entropy-Regularized RL
Robust Approximate Sampling via Stochastic Gradient Barker Dynamics
(ends 8:00 AM)
8 a.m.
Posters 8:00-
(ends 8:30 AM)
9 a.m.
Affinity Event:
(ends 11:00 AM)
10 p.m.
(ends 8:00 AM)
11 p.m.
Mentoring Event (D&I):
tbd
(ends 12:00 AM)

FRI 3 MAY
midnight
Invited Talk:
Aaditya Ramdas
(ends 1:00 AM)
1 a.m.
Morning Coffee Break
1:30 a.m.
Orals -
Positivity-free Policy Learning with Observational Data
Best-of-Both-Worlds Algorithms for Linear Contextual Bandits
Policy Learning for Localized Interventions from Observational Data
Exploration via linearly perturbed loss minimisation
(ends 2:30 AM)
2:30 a.m.
Orals -
Membership Testing in Markov Equivalence Classes via Independence Queries
Causal Modeling with Stationary Diffusions
On the Misspecification of Linear Assumptions in Synthetic Controls
General Identifiability and Achievability for Causal Representation Learning
(ends 3:30 AM)
3:30 a.m.
Lunch - retail
Mentoring Event (D&I):
(ends 5:00 AM)
5 a.m.
Test Of Time:
(ends 6:00 AM)
6:15 a.m.
Afternoon Coffee Break
7 a.m.
Orals -
End-to-end Feature Selection Approach for Learning Skinny Trees
Probabilistic Modeling for Sequences of Sets in Continuous-Time
Learning to Defer to a Population: A Meta-Learning Approach
An Impossibility Theorem for Node Embedding
(ends 8:00 AM)
8 a.m.
Posters 8:00-
(ends 8:30 AM)
10 p.m.
(ends 8:00 AM)
11 p.m.
Mentoring Event (D&I):
tbd
(ends 12:00 AM)

SAT 4 MAY
midnight
1 a.m.
Morning Coffee Break
1:30 a.m.
Orals -
Mind the GAP: Improving Robustness to Subpopulation Shifts with Group-Aware Priors
Functional Flow Matching
Deep Classifier Mimicry without Data Access
Multi-Resolution Active Learning of Fourier Neural Operators
(ends 2:30 AM)
2:30 a.m.
Orals -
Transductive conformal inference with adaptive scores
Approximate Leave-one-out Cross Validation for Regression with $\ell_1$ Regularizers
Failures and Successes of Cross-Validation for Early-Stopped Gradient Descent
Testing exchangeability by pairwise betting
(ends 3:30 AM)
3:30 a.m.
Lunch - retail
Mentoring Event (D&I):
(ends 5:00 AM)
5 a.m.
Orals -
Efficient Data Shapley for Weighted Nearest Neighbor Algorithms
On Counterfactual Metrics for Social Welfare: Incentives, Ranking, and Information Asymmetry
Joint Selection: Adaptively Incorporating Public Information for Private Synthetic Data
Is this model reliable for everyone? Testing for strong calibration
(ends 6:00 AM)
6 a.m.
Posters -
(ends 8:30 AM)