Enhances reinforcement learning from sparse data.
problem Limited data for offline reinforcement learning.
method Trajectory-based data augmentation.
result Improves reinforcement learning performance.
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,742 papers · 148 categories
Trend · papers per month
48 results for “suboptimal trajectories”
Novel IRL method identifies suboptimal medical decisions in ICU data.
problem Identifying suboptimal medical decisions in clinical settings.
method Incorporates Inverse Reinforcement Learning with a pruning step to identify and remove suboptimal actions.
result Pruning step effectively identifies clinical priorities and values from suboptimal data.
A new algorithm for offline RL with trajectory-wise reward reduces bias and variance errors.
problem Offline RL with trajectory-wise reward incurs large bias and variance errors.
method PARTED algorithm that decomposes trajectory return into proxy rewards and performs pessimistic value iteration.
result PARTED achieves provably efficient suboptimality bounds in general MDPs with trajectory-wise reward.
Develops anytime-valid stopping rules for SGD based on observed trajectory.
problem Stopping stochastic gradient descent (SGD) based on observed trajectory.
method Develops anytime-valid confidence sequences for stochastic gradient methods.
result Statistically valid, time-uniform stopping rules for SGD across convex and nonconvex settings.
Policy gradient methods have demonstrated success in reinforcement learning tasks that have high-dimensional continuous state and action spaces. However, policy gradient methods are also notoriously sample inefficient. This can be attributed, at least in part, to the high variance in estimating the gradient of the task…
Improving Model-Based Control and Active Exploration with Reconstruction Uncertainty Optimizationcs.LG
Model based predictions of future trajectories of a dynamical system often suffer from inaccuracies, forcing model based control algorithms to re-plan often, thus being computationally expensive, suboptimal and not reliable. In this work, we propose a model agnostic method for estimating the uncertainty of a model?s pr…
Paper explores limits of imitation learning in MDPs, setting new suboptimality bounds.
problem Understanding the statistical limits of imitation learning in MDPs.
method Analyzes minimax statistical limits in two settings: pre-interaction and interaction.
result Establishes suboptimality bounds for imitation learning in MDPs, showing improvements with knowledge of transition.
New algorithm reduces suboptimality in imitation learning to nearly optimal levels.
problem Statistical limits of imitation learning in MDPs with known transitions.
method Mimic-MD algorithm and reduction to value estimation problem.
result Upper bound of for suboptimality, with efficient computation.
Two algorithms improve Federated RL in diverse environments.
problem Collaborative learning in environments with varying dynamics.
method Proposed two federated RL algorithms, QAvg and PAvg, and a personalization heuristic.
result Achieved better performance and generalization in diverse environments.
Enhances RL in target domains with limited data using augmented return.
problem Utilize data from an accessible source domain to improve policy learning in a target domain with scarce data.
method Return Augmented Decision Transformer (REAG) method, which augments the return in the source domain to align with the target domain's optimal trajectory distribution.
result The proposed REAG method achieves the same level of suboptimality as without a dynamics shift, enhancing DT type frameworks' performance in off-dynamics RL.
Rotation invariant algorithms fail on sparse problems even with noise.
problem Rotation invariant algorithms' suboptimality in sparse linear problems with noise.
method Lower bounds and trajectory analysis of optimization algorithms.
result Rotation invariant algorithms are suboptimal even with noise and many examples.
Paper presents a probabilistic framework for diffusion synchronization.
problem Improper application of heuristics leads to suboptimal results in diffusion synchronization.
method Develops a probabilistic framework to analyze and adapt correlation models for each specific task.
result Achieves better results by identifying optimal correlation models per task.
New algorithm reduces MDP regret by accounting for state suboptimality gaps and variance.
problem Reducing regret in episodic MDPs with varying state suboptimality gaps.
method Introduced MVP algorithm with variance-aware gap-dependent regret bound.
result Achieved a variance-aware gap-dependent regret bound for MDPs.
Self-driving vehicles (SDVs) hold great potential for improving traffic safety and are poised to positively affect the quality of life of millions of people. To unlock this potential one of the critical aspects of the autonomous technology is understanding and predicting future movement of vehicles surrounding the SDV.…
New model uses minimal data to outperform traditional hedging strategies.
problem Optimizing hedging strategies with transaction costs and limited data.
method Model-free deep learning approach using a small number of trajectories.
result Neural network outperforms Black & Scholes and Leland models.
Bayesian fusion improves radar target recognition for UAVs.
problem Improving radar target recognition for UAVs using multistatic radar configurations.
method Proposes a fully Bayesian RATR framework using Optimal Bayesian Fusion (OBF) to aggregate classification probability vectors from multiple radars.
result Empirical results show that the OBF method significantly enhances classification accuracy compared to other fusion methods and single radar configurations.
Paper tackles RLHF with DCPPO method, proving near-optimal suboptimality.
problem Challenges in offline RLHF with limited human feedback and bounded rationality.
method DCPPO method involving three stages: MLE, reward function recovery, and pessimistic value iteration.
result DCPPO's suboptimality almost matches classical pessimistic offline RL in terms of distribution shift and dimension.
New algorithm tackles confounding in offline RL for partially observable MDPs.
problem Confounding in offline reinforcement learning for partially observable MDPs.
method P3O algorithm using proximal causal inference and pessimistic confidence regions.
result Achieves -suboptimality for offline RL in POMDPs with confounded data.
Two entropy measures quantify suboptimal portfolio performance.
problem Measuring suboptimality in investment portfolios.
method Relative entropy (KL divergence) calculations.
result Suboptimal portfolios appear better than Kelly portfolios under certain measures.
CODA resolves coordination issues in offline multi-agent reinforcement learning.
problem Coordination failure in offline multi-agent reinforcement learning.
method Diffusion-based multi-agent trajectory generator for data augmentation.
result CODA resolves coordination pathologies in continuous polynomial games and complex benchmarks.
QuantaAlpha uses evolutionary algorithms to mine financial alpha robustly across market distributions.
problem Challenges in alpha mining due to market noise and regime shifts.
method Evolutionary framework treating each mining run as a trajectory, mutation, crossover, targeted revision, and reuse of effective patterns.
result Consistent gains over strong baselines and prior systems, achieving high IC and ARR.
The paper develops a method to predict ICU mortality risk across diverse patient populations.
problem Improving patient survival by recognizing risky trajectories during ICU stays.
method Domain adaptation strategies to learn mortality prediction models robust to diverse ICU populations.
result The proposed model outperforms baselines, achieving AUC numbers up to 0.88 for the Cardiac ICU population.
aMCL uses annealing to improve hypothesis diversity in ambiguous tasks.
problem Limitations of Winner-takes-all in predicting plausible hypotheses.
method Combines simulated annealing with Multiple Choice Learning (MCL).
result Enhanced exploration of hypothesis space during training.
POLAR optimizes treatment strategies in dynamic settings with statistical guarantees.
problem Optimizing sequential decisions in dynamic treatment regimes with robustness and statistical guarantees.
method Pessimistic model-based approach estimating transition dynamics and incorporating uncertainty penalties.
result Offers statistical and computational guarantees, including finite-sample bounds on policy suboptimality.
New method optimizes decision-making in uncertain environments.
problem Optimal decision-making under partial observability.
method Nested sequential Monte Carlo algorithm for continuous POMDPs.
result Demonstrated effectiveness on continuous POMDP benchmarks.
Two algorithms learn Gaussian graphical models from Glauber dynamics trajectories, achieving optimal performance.
problem Learning Gaussian graphical models from a single trajectory of a dependent stochastic process.
method Two algorithms based on dueling-neighborhood search and local statistics built from the update sequence of Glauber dynamics.
result Achieve dependence of the information-theoretic lower bounds, mixing-free and signal-optimal.
New suboptimal algorithm for best subset selection in high-dimensional data.
problem Nonconvex and computationally challenging best subset selection in linear regression.
method Introducing a new suboptimal algorithm and comparing it with other popular methods.
result The new procedure is a competitive suboptimal algorithm for high-dimensional data.
Proposes glocal hypergradient estimation for hyperparameter optimization.
problem Combining reliability and efficiency in hyperparameter optimization.
method Uses Koopman operator theory to approximate global hypergradients from local ones.
result Achieves both reliability and efficiency in hyperparameter optimization.
AdaScale-TuRBO improves high-dimensional Bayesian optimization by dynamically scaling the GP lengthscale.
problem Inappropriate lengthscale design in TuRBO's local GP model causes suboptimal performance in high dimensions.
method Proposes AdaScale-TuRBO, which scales the GP lengthscale with both problem dimension and trust region size.
result AdaScale-TuRBO robustly outperforms standard TuRBO and other methods on synthetic and real-world tasks.
Extrapolating Beyond Suboptimal Demonstrations via Inverse Reinforcement Learning from Observationscs.LG
A critical flaw of existing inverse reinforcement learning (IRL) methods is their inability to significantly outperform the demonstrator. This is because IRL typically seeks a reward function that makes the demonstrator appear near-optimal, rather than inferring the underlying intentions of the demonstrator that may ha…
New framework explains fast transfer of hyperparameters across model scales.
problem Understanding and optimizing hyperparameters for large-scale models.
method Developed a conceptual framework for HP transfer across scale, showing fast transfer is equivalent to useful transfer for compute-optimal grid search.
result Fast transfer of hyperparameters is equivalent to useful transfer for compute-optimal grid search, offering asymptotic computational advantage.
The maximum a posteriori (MAP) configuration of binary variable models with submodular graph-structured energy functions can be found efficiently and exactly by graph cuts. Max-product belief propagation (MP) has been shown to be suboptimal on this class of energy functions by a canonical counterexample where MP conver…
New method identifies flawed internal models of the world in animals.
problem How animals make decisions with partial sensory information.
method Generalizes Inverse Rational Control to continuous nonlinear dynamics and noise.
result Identifies the best internal model explaining an agent's actions.
Develops a learning model predictive controller for competitive racing.
problem Lack of exploration in state space and complexity in obstacle avoidance.
method Explores state space through multiple initializations and develops a new method for convex terminal set selection.
result Yields a richer terminal safe set and maintains convexity.
The Lasso is suboptimal in sparse linear regression due to design matrix constraints.
problem The suboptimality of the Lasso estimator in sparse linear regression.
method Characterization of optimal estimation rates and analysis of the Lasso estimator.
result The Lasso is provably minimax rate-suboptimal when the minimum singular value is small.
Optimal algorithms for non-linear ridge bandits reduce burn-in cost.
problem Non-linear models introduce a burn-in period with fixed cost.
method Two-stage algorithm: find initial action, then treat locally linear.
result Two-stage algorithm is statistically optimal.
New bounds on adaptivity cost in stochastic optimization.
problem Understanding the cost of changing strategies in stochastic optimization.
method Proving impossibility results for adaptivity in non-smooth stochastic convex optimization.
result Lower bounds on the price of adaptivity for different levels of uncertainty.
Paper introduces a method to generate physically feasible dynamics with physical priors.
problem Challenges in generating physically feasible dynamics under physical priors.
method Seamlessly incorporates physical priors into diffusion-based generative models.
result Efficient generation of physically realistic dynamics across various physical phenomena.
PE-SVI reduces SVI inference complexity by finding a suitable start point.
problem Complex posterior inference in graphical models leads to suboptimal learning.
method PE-SVI uses a pseudo-encoded start point to reduce gradient steps and step sizes.
result PE-SVI achieves the same ELBo objective as SVI with less than 1% of the required steps.
An Algorithmic Framework for Computing Validation Performance Bounds by Using Suboptimal Modelsstat.ML
Practical model building processes are often time-consuming because many different models must be trained and validated. In this paper, we introduce a novel algorithm that can be used for computing the lower and the upper bounds of model validation errors without actually training the model itself. A key idea behind ou…
Extends linear MDP to handle nonlinear rewards.
problem Restrictive linear MDP assumption limits real-world applicability.
method Proposes Generalized Linear MDP (GLMDP) with GLMs for rewards.
result Develops offline RL algorithms achieving suboptimality guarantees.
A graphical model is a structured representation of the data generating process. The traditional method to reason over random variables is to perform inference in this graphical model. However, in many cases the generating process is only a poor approximation of the much more complex true data generating process, leadi…
Large Language Models-Enabled Digital Twins for Precision Medicine in Rare Gynecological Tumorscs.CL
Study uses LLMs to create personalized treatment plans for rare gynecological tumors.
problem Suboptimal management and poor prognosis due to low incidence and heterogeneity of rare gynecological tumors.
method Developed a digital twin system using LLMs to integrate clinical and biomarker data.
result LLM-enabled digital twins efficiently model individual patient trajectories and identify potential treatment options.
The design of multiple experiments is commonly undertaken via suboptimal strategies, such as batch (open-loop) design that omits feedback or greedy (myopic) design that does not account for future effects. This paper introduces new strategies for the optimal design of sequential experiments. First, we rigorously formul…
Least Squares Estimators are suboptimal for 5D convex functions.
problem Suboptimality of Least Squares Estimators in estimating multidimensional convex functions.
method Analysis of natural subclasses of convex functions in random and fixed design settings.
result Risk of LSE is while minimax risk is for .
New study shows exponential lower bound for RL even with constant suboptimality gap.
problem Can RL be sample-efficient with a constant suboptimality gap?
method Analyzes reinforcement learning in the online setting with a linearly realizable optimal Q-function.
result An exponential sample complexity lower bound still holds even with a constant suboptimality gap.
We study the problem of discriminative sub-trajectory mining. Given two groups of trajectories, the goal of this problem is to extract moving patterns in the form of sub-trajectories which are more similar to sub-trajectories of one group and less similar to those of the other. We propose a new method called Statistica…
Training a source model optimally for its own task is suboptimal for downstream transfer.
problem The optimality of a source model for its own task hinders downstream transfer performance.
method Analyzes L2-SP ridge regression, characterizes transfer-optimal source penalty, and identifies alignment-dependent effects.
result Transfer benefits from stronger source regularization when aligned imperfectly, and from weaker regularization when aligned perfectly.