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

Trend · papers per month

55111166221 · Jun 202019922001200920172026
48 results for Unknown Environments

CoCoRL learns safe constraints from demonstrations with unknown rewards.

problem Learning safe constraints from demonstrations with different unknown rewards.
method Convex Constraint Learning for Reinforcement Learning (CoCoRL) constructs a convex safe set based on demonstrations.
result CoCoRL learns constraints that lead to safe driving behavior and can safely transfer to different tasks and environments.

New algorithm for reinforcement learning in uncertain environments with unknown thresholds.

problem Safety in reinforcement learning in unknown and uncertain environments.
method Growing-Window estimator sampling and Stochastic Pessimistic-Optimistic Thresholding (SPOT) algorithm.
result Achieves sublinear regret and constraint violation of ildeO(T) ilde{\mathcal{O}}(\sqrt{T}).

Neural Laplace Control tackles offline RL for continuous-time delayed systems with irregular observations.

problem Offline reinforcement learning problems involving continuous-time environments with delays and irregular observations.
method Combines a Neural Laplace dynamics model with a model predictive control (MPC) planner.
result Achieves near expert policy performance on continuous-time delayed environments.

Method identifies unknown intervention targets in structural causal models from diverse data.

problem Identifying unknown intervention targets in structural causal models from heterogeneous data.
method Two-phase approach: first recovers exogenous noises, second matches with endogenous variables.
result Proposed method uniquely identifies intervention targets under causal sufficiency assumption.

New algorithm reduces dynamic regret for MDPs with unknown transition and adversarial rewards.

problem Episodic linear mixture MDPs with unknown transition and adversarial rewards.
method Combines occupancy-measure-based global optimization and policy-based variance-aware value-targeted regression.
result Achieves near-optimal dynamic regret of O~(dH3K+HK(H+PˉK))\widetilde{\mathcal{O}}(d \sqrt{H^3 K} + \sqrt{HK(H + \bar{P}_K)}).

In many important machine learning applications, the training distribution used to learn a probabilistic classifier differs from the testing distribution on which the classifier will be used to make predictions. Traditional methods correct the distribution shift by reweighting the training data with the ratio of the de…

2018-06-16abs ↗pdf ↗

This paper tackles CRL for multi-node interventions, achieving identifiability guarantees.

problem CRL under unknown multi-node interventions, focusing on single-node assumptions.
method Establishes identifiability results for general latent causal models under stochastic interventions.
result Identifiability up to ancestors using soft interventions, perfect identifiability using hard interventions.

We consider the problem of learning by demonstration from agents acting in unknown stochastic Markov environments or games. Our aim is to estimate agent preferences in order to construct improved policies for the same task that the agents are trying to solve. To do so, we extend previous probabilistic approaches for in…

2014-08-09abs ↗pdf ↗

We consider the problem of learning by demonstration from agents acting in unknown stochastic Markov environments or games. Our aim is to estimate agent preferences in order to construct improved policies for the same task that the agents are trying to solve. To do so, we extend previous probabilistic approaches for in…

2013-07-14abs ↗pdf ↗

The paper shows how to learn causal representations with few environments and finite samples.

problem Learning causal representations from limited data and environments.
method Explicit, finite-sample guarantees with a logarithmic number of interventions.
result Consistent recovery of latent causal graph, mixing matrix, and unknown intervention targets.

New RL approach learns dynamic VCG mechanisms in unknown MDP environments.

problem Learning dynamic VCG mechanisms in unknown MDP environments.
method Reward-free online RL for exploration, combined with function approximation.
result Regret bound of O~(T2/3)\tilde{\mathcal{O}}(T^{2/3}) for dynamic VCG mechanism learning.

UAV uses RL to navigate, map, and detect targets in unknown environments.

problem Optimizing UAV trajectory for accurate mapping and target detection in unknown environments.
method Formulated as an MDP, UAV uses RL to infer navigation policy.
result UAV autonomously explores high target detection areas while reconstructing the environment.

Deep learning agent improves pedestrian navigation in urban environments.

problem Autonomous driving among pedestrians in urban areas.
method Multi-objective deep reinforcement learning using a deep Q-learning variant.
result The multi-objective DQN agent outperforms single-objective DQN in various environments.

Algorithm learns from offline data to improve performance in target environment.

problem Learning from offline data in a target environment with unknown shifts.
method Adaptive algorithm that uses offline data to improve performance when informative.
result Algorithm provably improves performance over purely online learning when offline data are informative.

Improved RL algorithm stabilizes unknown linear systems with polynomial regret.

problem Learning and stabilizing unknown linear dynamical systems.
method Proposes an algorithm with an improved exploration strategy for fast stabilization.
result Achieves ildeO(T) ilde{\mathcal{O}}(\sqrt{T}) regret after TT time steps.

Reinforcement learning would enjoy better success on real-world problems if domain knowledge could be imparted to the algorithm by the modelers. Most problems have both hidden state and unknown dynamics. Partially observable Markov decision processes (POMDPs) allow for the modeling of both. Unfortunately, they do not p…

2012-12-12abs ↗pdf ↗

This research generates synthetic data streams for handling concept drifts and novel classes.

problem Handling concept drifts and novel classes in dynamic data streams.
method Synthetic data stream generation for both concept drifts and novel classes.
result Demonstrates the effectiveness of unsupervised drift detectors in open set recognition.

FAIR-NN finds invariant variables for causal inference across diverse environments.

problem Nonparametric invariance and causal learning in regression models with varying joint distributions.
method FAIR-NN framework using adversarial optimization and neural networks.
result FAIR-NN identifies invariant variables and quasi-causal variables under minimal conditions.

New algorithms adaptively calibrate predictions in non-stationary environments, matching optimal rates.

problem Designing online prediction algorithms that adapt to varying levels of non-stationarity.
method Epoch-based scheduling and non-uniform partitioning of the prediction space.
result Achieves adaptive calibration guarantees under multiple measures with optimal rates.

Iterative method learns unknown constraints for MPC control.

problem Learning to satisfy unknown polyhedral state constraints in iterative MPC.
method Collects and improves estimates of unknown constraints using collected data, designs an MPC controller to satisfy the estimated constraints.
result Robust and probabilistic guarantees of constraint satisfaction as a function of task iterations.

AI agent learns to handle unknown unknown states in reinforcement learning.

problem Handling unexpected, previously unseen states in reinforcement learning.
method Proposes EMDP-GA model with NIVE approach to expand value functions.
result Asymptotically consistent regret and comparable computational complexity.

Bayesian nonparametric models improve tracking in cluttered environments.

problem Robust tracking of moving targets in high clutter environments.
method Employing Bayesian nonparametric models to estimate target and clutter measurements.
result Improved tracking performance and effectiveness in high clutter environments.

Safe learning in uncertain systems with state measurements and optimization.

problem Safe learning in nonlinear control-affine systems with unknown additive uncertainty.
method Model uncertainty as Gaussian noise, learn mean and covariance, use optimization to adjust control input.
result Guaranteed safety with arbitrarily large probability while learning and control proceed simultaneously.

Computer simulation provides an automatic and safe way for training robotic control policies to achieve complex tasks such as locomotion. However, a policy trained in simulation usually does not transfer directly to the real hardware due to the differences between the two environments. Transfer learning using domain ra…

2018-10-12abs ↗pdf ↗

Multi-armed bandit algorithms have become a reference solution for handling the explore/exploit dilemma in recommender systems, and many other important real-world problems, such as display advertisement. However, such algorithms usually assume a stationary reward distribution, which hardly holds in practice as users' …

2018-05-23abs ↗pdf ↗

In this paper we target the problem of transferring policies across multiple environments with different dynamics parameters and motor noise variations, by introducing a framework that decouples the processes of policy learning and system identification. Efficiently transferring learned policies to an unknown environme…

2019-11-19abs ↗pdf ↗

The paper proposes a method for distribution-free prediction sets that adapt to unknown temporal changes.

problem Distribution-free prediction sets require reliable calibration data, which is often unavailable in real-world settings with temporal changes.
method The method selects an adaptive window to construct prediction sets, optimizing a bias-variance tradeoff.
result The method provides sharp coverage guarantees and is shown to be adaptive to temporal drift through numerical experiments.

Adversarial RL recovers agent rewards from financial market data simulations.

problem Recovering agent rewards in volatile financial markets with unknown dynamics.
method Adversarial inverse reinforcement learning in latent space simulations.
result Adversarial RL can robustly recover agent rewards from latent space representations of real market data.

A new estimator for evaluating policies in unknown environments.

problem Evaluating policies when both logging policy and value function are unknown.
method Doubly-Robust (DR) off-policy evaluation (OPE) estimator, DRUnknown, that estimates both the logging policy and value function.
result DRUnknown achieves the smallest asymptotic variance and is optimal when both models are correctly specified.

A new buffer system improves continual learning in RL agents by adapting to changing environments.

problem Improving RL agents' ability to learn from changing environments over time.
method Multi-timescale replay buffer combined with invariant risk minimization.
result The method shows improvement over baselines in continual learning settings.

Optimistic Thompson Sampling reduces regret in unknown multi-player games.

problem Navigating uncertainty in unknown multi-player games with strategic decision-making.
method Introduces Thompson Sampling algorithms that exploit opponents' actions and reward structures.
result Achieves over tenfold improvements in experimental budgets with logarithmic regret bound.

ARTEO algorithm optimizes safety-critical systems with uncertainty.

problem Decision-making under uncertainty with safety constraints in real-time optimization.
method ARTEO algorithm uses multi-armed bandits as a mathematical programming problem subject to safety constraints, learning unknown characteristics through exploration and incorporating uncertainty quantification.
result ARTEO achieves less cumulative regret with accurate and safe decisions.