Skip to yearly menu bar Skip to main content


Show Detail Timezone:
America/Los_Angeles
 
Filter Rooms:  

FRI 2 MAY
6 p.m.
(ends 2:00 AM)
6:30 p.m.
Opening Remarks:
(ends 7:00 PM)
7 p.m.
Invited Talk:
Chris Holmes
(ends 8:00 PM)
8 p.m.
Break:
(ends 8:30 PM)
8:30 p.m.
Orals -
A Random Matrix Theory Perspective on the Spectrum of Learned Features and Asymptotic Generalization Capabilities
Learning Graph Node Embeddings by Smooth Pair Sampling
Loss Gradient Gaussian Width based Generalization and Optimization Guarantees
Symmetry-Based Structured Matrices for Efficient Approximately Equivariant Networks
What Ails Generative Structure-based Drug Design: Expressivity is Too Little or Too Much?
(ends 9:30 PM)
9:30 p.m.
Panel:
(ends 10:30 PM)
10:30 p.m.
Break:
(ends 12:00 AM)

SAT 3 MAY
midnight
Orals -
Additive Model Boosting: New Insights and Path(ologie)s
Causal discovery in mixed additive noise models
Distributional Counterfactual Explanations With Optimal Transport
Importance-weighted Positive-unlabeled Learning for Distribution Shift Adaptation
On Distributional Discrepancy for Experimental Design with General Assignment Probabilities
(ends 1:00 AM)
1 a.m.
Posters -
(ends 4:00 AM)
4 a.m.
Reception:
(ends 6:00 AM)
6:30 p.m.
(ends 2:00 AM)
7 p.m.
Invited Talk:
Akshay Krishnamurthy
(ends 8:00 PM)
8 p.m.
Break:
(ends 8:30 PM)
8:30 p.m.
Orals -
Cubic regularized subspace Newton for non-convex optimization
Implicit Diffusion: Efficient optimization through stochastic sampling
ScoreFusion: Fusing Score-based Generative Models via Kullback–Leibler Barycenters
The Pivoting Framework: Frank-Wolfe Algorithms with Active Set Size Control
Unbiased and Sign Compression in Distributed Learning: Comparing Noise Resilience via SDEs
(ends 9:30 PM)
9:30 p.m.
Awards:
(ends 10:30 PM)
10:30 p.m.
Break:
(ends 12:00 AM)

SUN 4 MAY
midnight
Orals -
Almost linear time differentially private release of synthetic graphs
A Novel Convex Gaussian Min Max Theorem for Repeated Features
Balls-and-Bins Sampling for DP-SGD
Some Targets Are Harder to Identify than Others: Quantifying the Target-dependent Membership Leakage
The Sample Complexity of Stackelberg Games
(ends 1:00 AM)
1 a.m.
Posters -
(ends 4:00 AM)
6:30 p.m.
(ends 2:00 AM)
7 p.m.
Invited Talk:
Aapo Hyvarinen
(ends 8:00 PM)
8 p.m.
Break:
(ends 8:30 PM)
8:30 p.m.
Orals -
Entropic Matching for Expectation Propagation of Markov Jump Processes
Information Transfer Across Clinical Tasks via Adaptive Parameter Optimisation
posteriordb: Testing, Benchmarking and Developing Bayesian Inference Algorithms
Restructuring Tractable Probabilistic Circuits
Variation Due to Regularization Tractably Recovers Bayesian Deep Learning Uncertainty
(ends 9:30 PM)
9:30 p.m.
Orals -
Corruption Robust Offline Reinforcement Learning with Human Feedback
Hybrid Transfer Reinforcement Learning: Provable Sample Efficiency from Shifted-Dynamics Data
Multi-marginal Schrödinger Bridges with Iterative Reference Refinement
Near-Optimal Algorithm for Non-Stationary Kernelized Bandits
Pure Exploration with Feedback Graphs
(ends 10:30 PM)
10:30 p.m.
Break:
(ends 12:00 AM)

MON 5 MAY
midnight
Orals -
A Robust Kernel Statistical Test of Invariance: Detecting Subtle Asymmetries
Certifiably Quantisation-Robust training and inference of Neural Networks
Learning from biased positive-unlabeled data via threshold calibration
Robust Kernel Hypothesis Testing under Data Corruption
Statistical Learning of Distributionally Robust Stochastic Control in Continuous State Spaces
(ends 1:00 AM)
1 a.m.
Posters -
(ends 4:00 AM)