Simpler one-step distributional RL framework for control.
problem Lack of a unified theory for DistrRL in control.
method One-step distributional reinforcement learning (OS-DistrRL) framework.
result Unified theory for policy evaluation and control.
On-device research index
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
168,694 papers · 148 categories
Trend · papers per month
48 results for “one-step learning”
The paper improves model-based reinforcement learning by using multi-timestep objectives.
problem Compounding errors in one-step dynamics models as trajectory length increases.
method Developed a multi-timestep objective as a weighted sum of losses at various future horizons.
result Exponentially decaying weights significantly improve long-horizon performance.
One-step policy improvement outperforms iterative RL methods on D4RL.
problem Improving offline RL without off-policy evaluation.
method One-step constrained/regularized policy improvement using on-policy Q estimates.
result One-step algorithm outperforms iterative algorithms on D4RL benchmark.
A novel method for clustering multi-view data using dual representations.
problem Clustering multi-view data with consistent and unique information.
method One-step multi-view clustering method exploiting dual representations.
result The proposed method improves clustering performance on benchmark datasets.
One-step learning in crosspoint memory reduces computation time.
problem Real-time AI at the edge requires fast, low-energy computing.
method Crosspoint resistive memory with feedback configures linear and logistic regression.
result Linear and logistic regression can be computed in one step.
A new machine learning method for Bayesian inverse problems in function spaces.
problem Bayesian inverse problems in function spaces with incompatibility of white noise sources.
method One-step generative transport with amortized neural operator and prior-aligned Gaussian random field.
result Generative operator trained on prior samples and noisy observations generates posterior samples efficiently.
A new one-step method for covariate shift adaptation.
problem Real-world data often violates the assumption of same distribution for training and test samples.
method Proposes a one-step optimization approach to jointly learn the model and weights.
result The proposed method achieves a generalization error bound and is empirically effective.
EM Distillation simplifies diffusion models to one-step generators.
problem Efficient sampling from complex diffusion models with minimal loss of quality.
method EM Distillation, a maximum likelihood approach based on Expectation-Maximization.
result EM Distillation outperforms existing one-step generative methods in FID scores.
A Multi-step Loss Function for Robust Learning of the Dynamics in Model-based Reinforcement Learningcs.LG
The paper introduces a multi-step loss function to improve model-based reinforcement learning.
problem Compounding of one-step prediction errors in long trajectories.
method A multi-step objective function combining MSE losses at various future horizons.
result Models trained with the multi-step loss achieve significant improvement in future prediction.
Model-based reinforcement learning is an appealing framework for creating agents that learn, plan, and act in sequential environments. Model-based algorithms typically involve learning a transition model that takes a state and an action and outputs the next state---a one-step model. This model can be composed with itse…
A new method learns straight trajectories in one step for optimal flow matching.
problem Learning flows with straight trajectories for fast inference.
method Optimal Flow Matching (OFM) approach using convex functions for vector fields.
result Recovering straight OT displacements in just one FM step for quadratic transport.
Noise Consistency Training: A Native Approach for One-Step Generator in Learning Additional Controlscs.LG
NCT simplifies one-step generator adaptation to new controls.
problem Adapting one-step generators to new control conditions.
method Noise Consistency Training (NCT) integrates new controls without retraining.
result NCT achieves state-of-the-art controllable generation in a single pass.
One-step Bellman alignment improves online RL by reducing task mismatch.
problem Online RL struggles with task similarity defined by rewards or transitions.
method One-step Bellman alignment and re-weighted targeting (RWT) to correct task mismatch.
result Regret bounds show task shift complexity, not target MDP, affects performance.
In this paper we propose using the principle of boosting to reduce the bias of a random forest prediction in the regression setting. From the original random forest fit we extract the residuals and then fit another random forest to these residuals. We call the sum of these two random forests a \textit{one-step boosted …
Distributed statistical inference has recently attracted enormous attention. Many existing work focuses on the averaging estimator. We propose a one-step approach to enhance a simple-averaging based distributed estimator. We derive the corresponding asymptotic properties of the newly proposed estimator. We find that th…
The paper develops a theory for one-step Wasserstein-guided models for PDE-induced measures.
problem Theoretical understanding of generative models' accuracy in scientific computing.
method Regularity theory for optimal transport between doubling measures, excess-risk bounds.
result One-step Wasserstein-guided generative models can approximate PDE-induced measures with Hölder continuity.
Injecting adversarial examples during training, known as adversarial training, can improve robustness against one-step attacks, but not for unknown iterative attacks. To address this challenge, we first show iteratively generated adversarial images easily transfer between networks trained with the same strategy. Inspir…
LoRA-One uses one-step full gradient to align adapters for efficient large model fine-tuning.
problem Fine-tuning large language models efficiently and accurately.
method Properly initializing LoRA adapters using the one-step full gradient and incorporating preconditioners.
result LoRA-One achieves significant empirical improvements over existing methods.
One-step diffusion samplers reduce sampling time and computational costs.
problem Efficient sampling from complex distributions.
method One-step diffusion, self-distillation, deterministic flow.
result Achieves competitive sample quality with fewer evaluations.
Robust Transformer-Based One-Step Stock Index Forecasting via Shifted Data Augmentation
problem Robust stock index forecasting
method Modified Transformer architecture with Shifted Data Augmentation
result Best performance on benchmark datasets
Paper presents faster, robust adversarial training methods.
problem Increasing neural network robustness against adversarial attacks.
method Integrates FGSM with Pixelwise Noise Injection Layer (PNIL) and uniform noise.
result Achieves comparable results to PGD-based adversarial training but faster.
W-Flow generates images in one step, faster and better than multi-step methods.
problem Efficiently generating images from a simple reference distribution to a target data distribution.
method W-Flow uses Wasserstein gradient flows to transform the reference distribution to the target distribution in a single step, trained with Sinkhorn divergence.
result W-Flow achieves state-of-the-art results in ImageNet 256256 generation with improved mode coverage and faster sampling.
Unified framework for data-free sampling using Wasserstein gradient flows.
problem Efficient sampling from unnormalized distributions without data.
method Unified theoretical framework based on Wasserstein gradient flows.
result Unified form of velocity field for various f-divergences.
Improved knowledge gradient (iKG) outperforms the original KG algorithm in best arm identification problems.
problem Best arm identification (BAI) problem with limitations of the original KG algorithm.
method Follows the one-step look ahead of KG but chooses the measurement that maximizes the probability of selecting the best arm.
result Improved knowledge gradient (iKG) is asymptotically optimal and easier to extend to variant BAI problems.
New methods use vector search and nearest-neighbor matching for policy learning in causal inference.
problem Learning optimal policies in causal inference with limited data.
method RAG-based policy learning with vector search and nearest-neighbor matching.
result The methods bound the within-candidate choice regret and evaluate the one-step method directly as a policy.
This paper learns multi-modal embeddings from text, audio, and video views/modes of data in order to improve upon down-stream sentiment classification. The experimental framework also allows investigation of the relative contributions of the individual views in the final multi-modal embedding. Individual features deriv…
Approximation of supply curvesq-fin.PR
The paper approximates supply curves using a one-step basis method.
problem Computing supply curves accurately and efficiently.
method Derives L2 approximation expression and proposes node selection procedure.
result Illustrates the approach with European electricity market bid curves.
SMT trains generative models by estimating mixture scores, outperforming existing methods.
problem Training one-step generative models efficiently and effectively.
method Score-of-Mixture Training (SMT) estimates the score of mixture distributions between real and fake samples.
result SMT/SMD outperform existing methods on CIFAR-10 and ImageNet 64x64 datasets.
SiD distills pretrained diffusion models into a fast one-step generator.
problem Efficiently distilling pretrained diffusion models into a fast generator.
method Reformulates forward diffusion processes as semi-implicit distributions and uses three score-related identities to create a loss mechanism.
result Achieves high FID performance and significantly reduces generation time.
We consider Model-Agnostic Meta-Learning (MAML) methods for Reinforcement Learning (RL) problems, where the goal is to find a policy using data from several tasks represented by Markov Decision Processes (MDPs) that can be updated by one step of stochastic policy gradient for the realized MDP. In particular, using stoc…
Proposes a graph dynamics prior for more accurate relational inference.
problem Identifying interactions in dynamical systems from observed dynamics.
method Graph Dynamics Prior (GDP) that uses error amplification in non-local polynomial filters.
result Reconstructs graphs more accurately than previous methods, robust to under-sampling.
FasterVoiceGrad speeds up VC by 6-7x with novel distillation.
problem Slow iterative sampling in diffusion-based VC models.
method Adversarial diffusion conversion distillation (ADCD) to create a faster one-step model.
result 6.6-6.9 and 1.8x faster on GPU and CPU, respectively.
GENIE balances domain-invariant feature learning and gradient alignment for improved DG performance.
problem Domain Generalization (DG) overfitting to domain-specific features
method GENIE (Generalization-ENhancing Iterative Equalizer) optimizer
result Prevents a small subset of parameters from dominating optimization, promoting domain-invariant feature learning
In this article the Lorenz dynamical system is revived and revisited and the current state of the art results for one step ahead forecasting for the Lorenz trajectories are published. Multitask learning is shown to help learning the hard to learn z trajectory. The article is a reflection upon the evolution of neural ne…
Dynamic risk measures follow law invariance principles over time.
problem Tackles dynamic risk measurement principles.
method Shows equivalence between adapted law invariance and recursive one-step conditional-law representation for time-consistent risk measures.
result Identifies adapted law invariance as the dynamic counterpart of ordinary law invariance.
Transformers Efficiently Perform In-Context Logistic Regression via Normalized Gradient Descentcs.LG
Transformers learn to perform logistic regression in-context.
problem Understanding how transformers learn to perform specific tasks in-context.
method Constructed multi-layer transformers that perform in-context logistic regression through normalized gradient descent.
result Transformers can be trained to perform in-context logistic regression effectively.
CW-EDMD improves prediction accuracy by learning local Koopman models for different state-space regions.
problem Inefficient global Koopman operator approximation for distinct local dynamics.
method Cluster-Weighted EDMD (CW-EDMD) learns a soft phase-space partition and per-cluster EDMD operators using EM objective.
result CW-EDMD significantly reduces prediction errors across various systems and configurations.
We consider a problem of stochastic online learning with general probabilistic graph feedback, where each directed edge in the feedback graph has probability . Two cases are covered. (a) The one-step case, where after playing arm the learner observes a sample reward feedback of arm with independent prob…
New insights into neural network feature learning through multi-step gradient descent.
problem Understanding feature learning in two-layer neural networks with limited width.
method Characterization of feature learning through two steps of gradient descent with specific step sizes.
result The second step of gradient descent reveals multiple learned directions, not limited to a single direction as in the first step.
FastVoiceGrad speeds up VC to one step, matching or surpassing quality.
problem Slow inference in multi-step diffusion-based VC.
method Adversarial Conditional Diffusion Distillation (ACDD) for one-step diffusion.
result One-shot VC with superior or comparable performance to multi-step methods.
Efficient estimators for smooth Hilbert-valued parameters with theoretical guarantees.
problem Estimating smooth Hilbert-valued parameters with theoretical guarantees.
method Pathwise differentiable Hilbert-valued parameters, efficient influence functions, regularized one-step estimators.
result Theoretical guarantees for efficient estimators even when nuisance functions are arbitrary.
Bayesian optimization has been successful at global optimization of expensive-to-evaluate multimodal objective functions. However, unlike most optimization methods, Bayesian optimization typically does not use derivative information. In this paper we show how Bayesian optimization can exploit derivative information to …
DLM-One speeds up language generation by 500x with continuous models.
problem Efficiently generating text sequences in natural language processing.
method Score-distillation of continuous diffusion language models.
result Achieves up to 500x speedup in inference time with competitive performance.
Epistasis (gene-gene interaction) is crucial to predicting genetic disease. Our work tackles the computational challenges faced by previous works in epistasis detection by modeling it as a one-step Markov Decision Process where the state is genome data, the actions are the interacted genes, and the reward is an interac…
We consider gradient descent with `momentum', a widely used method for loss function minimization in machine learning. This method is often used with `Nesterov acceleration', meaning that the gradient is evaluated not at the current position in parameter space, but at the estimated position after one step. In this work…
Consistency Modelscs.LG
Consistency models generate high-quality samples fast and without iterative sampling.
problem Slow generation in diffusion models.
method Direct mapping of noise to data, supporting fast one-step generation and multistep sampling.
result Consistency models achieve state-of-the-art FID scores and outperform diffusion models in one-step generation.
Linear Transformer Block combines MLP and linear attention for near-optimal ICL in linear regression.
problem Achieving near-optimal in-context learning (ICL) risk for linear regression with a Gaussian prior.
method Combines linear attention and MLP components in a Linear Transformer Block (LTB). Establishes correspondence with one-step gradient descent estimators ().
result LTB achieves nearly Bayes optimal ICL risk for linear regression with a Gaussian prior.
When environmental interaction is expensive, model-based reinforcement learning offers a solution by planning ahead and avoiding costly mistakes. Model-based agents typically learn a single-step transition model. In this paper, we propose a multi-step model that predicts the outcome of an action sequence with variable …