Research
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,657 papers · 148 categories

Trend · papers per month

66131197262 · Jun 202019922001200920172026
48 results for action-conditional guarantees

We enhance conformal prediction for risk-averse decisions with action-conditional guarantees.

problem Uncertainty quantification and safety guarantees for machine learning decisions.
method Action-conditional conformal prediction, pinball-loss minimization.
result Action-conditional prediction sets optimize risk-averse decision-making.

Comma.ai's approach to Artificial Intelligence for self-driving cars is based on an agent that learns to clone driver behaviors and plans maneuvers by simulating future events in the road. This paper illustrates one of our research approaches for driving simulation. One where we learn to simulate. Here we investigate v…

2016-08-03abs ↗pdf ↗

Learning to control robots directly based on images is a primary challenge in robotics. However, many existing reinforcement learning approaches require iteratively obtaining millions of robot samples to learn a policy, which can take significant time. In this paper, we focus on learning a realistic world model capturi…

2018-05-20abs ↗pdf ↗

Object-based approaches for learning action-conditioned dynamics has demonstrated promise for generalization and interpretability. However, existing approaches suffer from structural limitations and optimization difficulties for common environments with multiple dynamic objects. In this paper, we present a novel self-s…

2019-04-16abs ↗pdf ↗

We introduce Dynamic Planning Networks (DPN), a novel architecture for deep reinforcement learning, that combines model-based and model-free aspects for online planning. Our architecture learns to dynamically construct plans using a learned state-transition model by selecting and traversing between simulated states and…

2018-12-28abs ↗pdf ↗

KINet learns object interactions without supervision for robotic pushing.

problem Lack of supervised data for object-centric forward prediction.
method End-to-end unsupervised framework using keypoint representation and contrastive estimation.
result Automatically generalizes to unseen scenarios and accurately predicts future states.

In many online applications interactions between a user and a web-service are organized in a sequential way, e.g., user browsing an e-commerce website. In this setting, recommendation system acts throughout user navigation by showing items. Previous works have addressed this recommendation setup through the task of pre…

2018-09-07abs ↗pdf ↗

Deep neural network learns discrete state abstractions for efficient planning.

problem Efficient sequential decision making in large state spaces.
method Information bottleneck method for learning approximate bisimulations using deep neural encoders and action-conditioned HMM.
result Trained method efficiently plans for unseen goals in multi-goal reinforcement learning.

DRL agents perform poorly at high decision frequencies, but a new algorithm improves performance.

problem DRL agents struggle at high decision frequencies, leading to poor performance.
method Proved that DRL agents' action-conditioned return distributions collapse to their policy's return distribution as decision frequency increases. Defined superiority as a probabilistic generalization of advantage for high-frequency value-based RL.
result Proper modeling of superiority distribution improves performance of controllers at high decision frequencies.

Intelligent agents can learn to represent the action spaces of other agents simply by observing them act. Such representations help agents quickly learn to predict the effects of their own actions on the environment and to plan complex action sequences. In this work, we address the problem of learning an agent's action…

2018-06-25abs ↗pdf ↗

New method optimizes portfolios by dynamically integrating ESG constraints.

problem Static ESG scores mismatch sequential portfolio decisions.
method MACF-X, a family of adapters that learns ESG costs from multimodal evidence.
result Reduces tail ESG budget pressure while maintaining financial performance.

Unsupervised representation learning has succeeded with excellent results in many applications. It is an especially powerful tool to learn a good representation of environments with partial or noisy observations. In partially observable domains it is important for the representation to encode a belief state, a sufficie…

2018-11-15abs ↗pdf ↗

A new method for learning policies from demonstrations without reinforcement.

problem Learning policies from demonstrations without access to reinforcement signals.
method Energy-based distribution matching (EDM) to learn policy parameters and state marginals.
result EDM yields consistent performance gains over existing algorithms for strictly batch imitation learning.

Optimizes trading policies using future price forecasts.

problem Static reinforcement learning agents lack mechanisms for using price forecasts at inference time.
method FPILOT framework inspired by Model Predictive Control (MPC). Uses a predictive model to construct an allocation-based imagined return objective at each decision step.
result Consistent improvements in total return and risk-adjusted metrics across various policy learning algorithms.

Identifies latent actions and dynamics from offline data with diverse demonstrators.

problem Recovering latent actions and environment dynamics from action-free trajectories.
method Assumes distinct policies for each demonstrator, identifies latent transitions and policies via matrix factorization.
result Identifies latent transitions and demonstrator policies up to permutation.

Novel approach to learning models based on subjective timescales for better exploration and decision-making.

problem Learning models over multi-step timescales in environments with intermediate states.
method Developed a subjective-timescale model (STM) based on episodic memories, enabling systematic variation of temporal extent of predictions.
result STM produces more informative action-conditioned roll-outs, leading to better decision-making and exploration.

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.

UWM-JEPA predicts future scenarios in belief space, improving accuracy in partially observed environments.

problem Predicting future scenarios in partially observed environments with uncertainty.
method Introduces UWM-JEPA, a JEPA world model with a density-matrix latent and learned unitary predictor.
result UWM-JEPA achieves 0.77 accuracy on a hidden-velocity indicator task, outperforming LSTM-JEPA.

Study finds implicit government guarantee improves municipal investment bond ratings.

problem Questioning the objectivity of municipal investment bond ratings due to implicit government guarantee.
method Text mining of policy documents and PMC index model for implicit guarantee strength calculation.
result Implicit government guarantee boosts municipal investment bond ratings, especially in less developed regions.

This paper measures the intensity of implicit government guarantees using PMC index model.

problem Excessive local government debt due to implicit government guarantees.
method Text mining of policy documents related to municipal investment bonds, PMC index model.
result Recent policies have reduced the intensity of implicit government guarantees.

ConfHit provides valid guarantees for generative models without oracle access.

problem Reliable guarantees for novel candidate generation in generative models.
method Formalizes certification and refinement of generated sets, leveraging weighted exchangeability and density-ratio weighted conformal p-values.
result Consistently delivers valid coverage guarantees and compact certified sets across various generative tasks.

New DP algorithms with margin guarantees for various hypothesis sets.

problem Differential privacy in machine learning with margin guarantees.
method Developed pure and efficient DP learning algorithms for linear, kernel-based, and neural network hypotheses.
result Margin guarantees are independent of input dimension and hypothesis type.

The paper provides theoretical guarantees for optimized sampling in compressed sensing, showing error vanishes with more measurements.

problem Theoretical and practical improvements in compressed sensing with optimized sampling schemes.
method Theoretical analysis and empirical experiments with optimized sampling schemes for subsampled unitary matrices.
result The error caused by measurement noise vanishes with an increasing number of measurements for optimized sampling schemes, assuming Gaussian noise.

Paper proves robust estimators' generalization guarantees without dimensionality issues.

problem Generalization guarantees for Wasserstein distributionally robust models.
method Analyzes and extends existing guarantees to broader classes of models and regularized versions.
result Generalization guarantees hold without dimensionality issues and cover distribution shifts.

New algorithms achieve uniform-PAC guarantees for RL with bounded eluder dimension.

problem Achieving strong performance guarantees in reinforcement learning.
method Proposes algorithms for nonlinear bandits and model-based episodic RL with a bounded eluder dimension.
result Achieves uniform-PAC sample complexity that matches state-of-the-art regret bounds or sample complexity guarantees.

New guarantees for adaptive combinatorial maximization with various objectives.

problem Maximizing under cardinality constraints and minimum cost coverage in adaptive settings.
method Bayesian approach with comprehensive approximation guarantees for various utility functions.
result Maximal gain ratio is a new parameter that provides stronger approximation guarantees than greedy policies.

Exact generalization guarantees for robust models using Wasserstein distance are established.

problem Capturing data uncertainty and distribution shifts in machine learning models.
method Establishes exact generalization guarantees for robust models based on the Wasserstein distance, covering various cases and transport costs.
result Exact generalization guarantees are provided for a wide range of cases, including deep learning objectives with nonsmooth activations.

Improves bandits with knapsacks guarantees for partially stochastic workloads.

problem Improves guarantees for Bandits with Knapsacks (BwK) with partially stochastic workloads.
method Defines Approximately Stationary BwK, explores algorithms with smooth competitive ratios transitioning between stochastic and adversarial cases.
result Offers competitive ratios that smoothly transition between the best possible guarantees in stochastic and adversarial cases, especially beneficial when budget is small.

The paper proves statistical consistency and fairness guarantees for a plug-in algorithm.

problem Establishing statistical guarantees for fairness-aware binary classification.
method Proves statistical consistency and derives finite sample guarantees for the plug-in algorithm.
result The plug-in algorithm is statistically consistent and guarantees fairness and differential privacy.

Optimal liquidation using VWAP strategies has been considered in the literature, though never in the presence of permanent market impact and only rarely with execution costs. Moreover, only VWAP strategies have been studied and the pricing of guaranteed VWAP contracts has never been addressed. In this article, we devel…

2013-06-12abs ↗pdf ↗

Reinsurance can help life insurers maintain higher capital guarantees without losing utility.

problem Decreasing capital guarantees in life insurance products.
method Dynamic investment-reinsurance optimization problem with simultaneous Value-at-Risk and no-short-selling constraints. Introduced guarantee-equivalent utility gain for comparison.
result Optimally managed reinsurance allows insurers to offer higher capital guarantees without reducing expected utility.

Paper provides statistical guarantees for GNNs in link prediction.

problem Link prediction accuracy in graph neural networks.
method Proposes a linear GNN architecture (LG-GNN) and derives statistical guarantees.
result LG-GNN produces consistent estimators for edge probabilities and has better detection of high-probability edges.