Search Results for author:
Found 10 papers, 4 papers with code
Nearest Neighbour Score Estimators for Diffusion Generative Models
Score function estimation is the cornerstone of both training and sampling from diffusion generative models.
Analyzing and Improving Greedy 2-Coordinate Updates for Equality-Constrained Optimization via Steepest Descent in the 1-Norm
We show that bound- and summation-constrained steepest descent in the L1-norm guarantees more progress per iteration than previous rules and can be computed in only $O(n \log n)$ time.
Realistically distributing object placements in synthetic training data improves the performance of vision-based object detection models
When training object detection models on synthetic data, it is important to make the distribution of synthetic data as close as possible to the distribution of real data.
Video Killed the HD-Map: Predicting Multi-Agent Behavior Directly From Aerial Images
The development of algorithms that learn multi-agent behavioral models using human demonstrations has led to increasingly realistic simulations in the field of autonomous driving.
Noise Is Not the Main Factor Behind the Gap Between SGD and Adam on Transformers, but Sign Descent Might Be
This suggests that Adam outperform SGD because it uses a more robust gradient estimate.
Target-based Surrogates for Stochastic Optimization
Our target optimization framework uses the (expensive) gradient computation to construct surrogate functions in a \emph{target space} (e. g. the logits output by a linear model for classification) that can be minimized efficiently.
Vehicle Type Specific Waypoint Generation
We develop a generic mechanism for generating vehicle-type specific sequences of waypoints from a probabilistic foundation model of driving behavior.
Improved Policy Optimization for Online Imitation Learning
Specifically, if the class of policies is sufficiently expressive to contain the expert policy, we prove that DAGGER achieves constant regret.
Conditional Permutation Invariant Flows
We present a novel, conditional generative probabilistic model of set-valued data with a tractable log density.
Critic Sequential Monte Carlo
We introduce CriticSMC, a new algorithm for planning as inference built from a composition of sequential Monte Carlo with learned Soft-Q function heuristic factors.
