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

104208311415 · Jun 202019922001200920172026
48 results for environment design

This paper introduces CENIE to quantify environment novelty for better UED.

problem Challenges in measuring environment novelty for effective UED.
method CENIE framework using state-action space coverage and Gaussian Mixture Models.
result CENIE improves UED performance across multiple benchmarks.

AutoDIME automates design of multi-agent environments for RL.

problem Designing multi-agent environments for reinforcement learning is challenging.
method Developed intrinsic teacher rewards for multi-agent settings and evaluated them in various tasks.
result Value disagreement was found to be most consistent and effective across tasks.

Algorithm optimizes system design and control for better rewards.

problem Optimizing system design and control for maximum rewards.
method Deep reinforcement learning combining policy gradient and model-based optimization.
result DEPS algorithm outperforms state-of-the-art methods in various environments.

In radar systems, unimodular (or constant-modulus) waveform design plays an important role in achieving better clutter/interference rejection, as well as a more accurate estimation of the target parameters. The design of such sequences has been studied widely in the last few decades, with most design algorithms requiri…

2019-12-17abs ↗pdf ↗

Meta-learning improves drone trajectory design for dynamic wireless networks.

problem Designing optimal trajectories for energy-constrained drones in dynamic network environments.
method Proposes a meta-learning algorithm to adaptively tune a reinforcement learning solution for trajectory design.
result Meta-tuned RL yields faster convergence and improved communication performance compared to baseline algorithms.

Generative thermal design learns optimal shapes using multi-agent reinforcement learning.

problem Complex thermal design challenges due to convection-diffusion equation and boundary interactions.
method Cooperative multi-agent deep reinforcement learning with continuous geometric representation.
result Framework learns optimal design strategies without shape derivation or differentiable objectives.

Building agents that can explore their environments intelligently is a challenging open problem. In this paper, we make a step towards understanding how a hierarchical design of the agent's policy can affect its exploration capabilities. First, we design EscapeRoom environments, where the agent must figure out how to n…

2018-11-16abs ↗pdf ↗

We integrate information-theoretic concepts into the design and analysis of optimistic algorithms and Thompson sampling. By making a connection between information-theoretic quantities and confidence bounds, we obtain results that relate the per-period performance of the agent with its information gain about the enviro…

2019-11-21abs ↗pdf ↗

FTRL algorithm with negative entropy regularizer achieves best-of-three-world results for linear bandits.

problem Designing an FTRL algorithm for linear bandits with optimal regret bounds.
method Follow-the-regularized-leader (FTRL) algorithm with negative entropy regularizer.
result Regret bounds achieve the same or nearly the same order as detect-switch type algorithm but with simpler design.

Designers of AI agents often iterate on the reward function in a trial-and-error process until they get the desired behavior, but this only guarantees good behavior in the training environment. We propose structuring this process as a series of queries asking the user to compare between different reward functions. Thus…

2018-09-09abs ↗pdf ↗

This research tackles information design in multi-agent reinforcement learning.

problem Designing information to influence other adaptive agents in a non-stationary environment.
method Formulated Markov signaling game, introduced signaling gradient and extended obedience constraints.
result Developed efficient algorithm for mixed-motive tasks in multi-agent reinforcement learning.

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.

SAMPLR optimizes for ground truth in aleatoric parameters to avoid curriculum-induced covariate shift.

problem Curriculum learning shifts training distribution, leading to suboptimal policies in aleatoric settings.
method SAMPLR optimizes ground-truth utility function, avoiding curriculum-induced covariate shift.
result SAMPLR preserves optimality under ground-truth distribution, promoting robustness across various environments.

In many reinforcement learning tasks, the goal is to learn a policy to manipulate an agent, whose design is fixed, to maximize some notion of cumulative reward. The design of the agent's physical structure is rarely optimized for the task at hand. In this work, we explore the possibility of learning a version of the ag…

2018-10-09abs ↗pdf ↗

A new method optimizes in nonstationary environments with many arms efficiently.

problem Optimizing in nonstationary environments with a large number of arms.
method Gaussian interpolation to learn continuous Lipschitz reward functions in nonstationary environments.
result Efficiently learns continuous Lipschitz reward functions with O(T)\mathcal{O}^*(\sqrt{T}) cumulative regret.

Deep RL strategies outperform traditional methods in cryptocurrency trading.

problem Designing profitable trading strategies for cryptocurrency markets.
method Applied Proximal Policy Optimization, Soft Actor-Critic, and Generative Adversarial Imitation Learning to a Gym environment based on cryptocurrency markets.
result Highest gain of 4850 US dollars per 10000 US dollars investment on unseen data.

New algorithms reduce regret in both stochastic and deterministic environments.

problem Designing algorithms that perform well in both types of MDPs.
method Proposed new environment norms and algorithms with variance-dependent regret bounds.
result First algorithm with simultaneously optimal bounds for both stochastic and deterministic MDPs.

This paper designs a new on-chain option that amortizes perpetual options for blockchain environments.

problem No equivalent standard for on-chain options exists, leading to high-frequency oracles and liquidation engines failures.
method Develops an amortizing perpetual option contract tailored to blockchain constraints, introducing a decentralized market framework.
result Demonstrates that the new contract functions as a risk primitive for DeFi, enabling applications like endogenous collateralization and de-peg insurance.

RID-Noise improves robust design under noisy conditions using neural networks.

problem Design robustness under noisy environments.
method Robust Inverse Design under Noise (RID-Noise) using conditional invertible neural networks (cINNs).
result RID-Noise achieves more effective robust design compared to state-of-the-art methods.

New algorithm improves RL performance across different environments.

problem Improving reinforcement learning performance across various environments.
method Designing a fully model-free DRRL algorithm that learns from a single trajectory.
result Demonstrates superior robustness and sample efficiency compared to existing methods.

PSRL extension for continuing environments reduces regret.

problem Formalizing and analyzing resampling approach for reinforcement learning.
method Continuing PSRL maintains a model of the environment and replaces it with samples from the posterior distribution.
result Established an ildeO(τSAT) ilde{O}(τS \sqrt{A T}) bound on Bayesian regret.

ReOPD uses pre-collected teacher trajectories to distill knowledge from multi-turn interactions.

problem The cost of fully online on-policy distillation for multi-turn interactions.
method ReOPD, an off-environment alternative that reuses pre-collected teacher trajectories as replayed prefixes, addressing the prefix trap and distribution shift.
result ReOPD preserves or improves OPD-level accuracy, uses zero tool calls, and is at least 4imes imes faster per training step.

Reinforcement learning algorithms rely on carefully engineering environment rewards that are extrinsic to the agent. However, annotating each environment with hand-designed, dense rewards is not scalable, motivating the need for developing reward functions that are intrinsic to the agent. Curiosity is a type of intrins…

2018-08-13abs ↗pdf ↗

Deep Recurrent Q-Network improves autonomous driving in urban areas with pedestrians.

problem Challenges in urban autonomous driving due to complex road structures and unpredictable pedestrian behavior.
method Combines Deep Q-Network with LSTM for long-term memory, designed a 3-D state representation, and uses a reward function.
result The proposed DRQN-based approach outperforms rule-based methods in dense urban scenarios.

We introduce Procgen Benchmark, a suite of 16 procedurally generated game-like environments designed to benchmark both sample efficiency and generalization in reinforcement learning. We believe that the community will benefit from increased access to high quality training environments, and we provide detailed experimen…

2019-12-03abs ↗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 ↗

This paper analyzes switchback experiments in A/B testing, revealing key factors affecting their effectiveness.

problem Understanding the effectiveness of different switchback designs in A/B testing.
method Comprehensive comparative analysis of various switchback designs in Markovian environments, covering state-of-the-art RL estimators.
result The effectiveness of switchback designs depends on the size of the carryover effect and reward autocorrelations.

Model-based reinforcement learning (MBRL) is widely seen as having the potential to be significantly more sample efficient than model-free RL. However, research in model-based RL has not been very standardized. It is fairly common for authors to experiment with self-designed environments, and there are several separate…

2019-07-03abs ↗pdf ↗

Bayesian Invariant Prediction models stable features from multi-environment data.

problem Analyzing stable features across multiple environments for better prediction and understanding.
method Developed Bayesian Invariant Prediction (BIP) model that encodes invariant feature indices as latent variables and infers them via posterior inference.
result BIP and its variational approximation (VI-BIP) outperform existing methods in accuracy and scalability for invariant prediction.

How can we design safe reinforcement learning agents that avoid unnecessary disruptions to their environment? We show that current approaches to penalizing side effects can introduce bad incentives, e.g. to prevent any irreversible changes in the environment, including the actions of other agents. To isolate the source…

2018-06-04abs ↗pdf ↗