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

Trend · papers per month

6.3%12.5%18.8%25.0% · Apr 199319922001200920172026
48 results for Development Environment

VR enables professionals to develop deep learning models by moving virtual objects.

problem Challenges in understanding and developing deep learning models.
method Built a VR-based DL development environment where users interact with tangible objects to construct neural networks.
result Users can develop and understand DL models intuitively through VR, with real-time accuracy feedback.

A model is developed to study the effectiveness of innovation and its impact on structure creation and structure change on agent-based societies. The abstract model that is developed is easily adapted to any particular field. In any interacting environment, the agents receive something from the environment (the other a…

2007-09-17abs ↗pdf ↗

New approach transfers rewards learned in one environment to reinforcement learning in a new environment.

problem Transfer of rewards learned using inverse reinforcement learning from one environment to a new, different environment.
method Formulate the problem as a joint system of Bellman equations, develop minimax estimators for the target soft-qq-function, solve the source and target system of equations jointly.
result The coupled approach removes the first-order influence of source Bellman residual error compared to the sequential approach.

New approach handles stochastic and partially-observable environments using discrete autoencoders and Monte Carlo tree search.

problem Challenges in planning for stochastic and partially-observable environments.
method Uses discrete autoencoders and a stochastic variant of Monte Carlo tree search.
result Significantly outperforms MuZero on stochastic chess and scales to DeepMind Lab.

A machine learning environment for detecting autonomous vehicle corner cases.

problem Testing autonomous driving software in the real world is difficult.
method Connecting CARLA simulation software to TensorFlow and custom AI client software.
result The system can identify situations where AI software fails to understand the scenario.

Advantage amplification helps RL in slow-evolving latent-state environments.

problem Challenges in reinforcement learning for long-horizon latent-state environments.
method Temporal abstraction and aggregation methods to overcome belief state error and small action advantage.
result Proven advantage amplification in settings with slowly evolving latent states.

Competition aims to develop sample-efficient RL methods using human demonstrations.

problem Exponential increase in samples needed for reinforcement learning.
method Develop sample-efficient algorithms using human demonstrations.
result Introduction of MineRL ObtainDiamond task and MineRL-v0 dataset.

Develops HMRL for sparse reward RL problems, improving meta policy efficiency and transferability.

problem Difficulty in learning meta policies for sparse reward RL problems.
method Hyper-Meta RL framework with cross-environment meta state embedding and shaped meta reward.
result Improves meta policy generalization and efficiency for sparse reward RL problems.

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.

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.

Develops RL algorithm for lifelong non-stationary environments.

problem Challenges of reinforcement learning in environments with persistent change.
method Formalizes lifelong non-stationarity, uses latent variable models, and leverages online learning and probabilistic inference.
result Substantial improvement in performance over non-reasoning approaches in lifelong non-stationary environments.

Develops a risk-sensitive reinforcement learning framework for uncertain environments.

problem Learning in uncertain environments with varying risk preferences.
method Integrates utility functions and risk measures into reinforcement learning, tuning risk preference with parameter β.
result Risk-averse, risk-neutral, and risk-taking behaviors can be achieved and compared.

Estimator improves prediction with missing data in multi-environment settings.

problem Handling missing data in multi-environment settings for robust prediction.
method Derive an estimator from invariance objective under missing outcomes.
result The estimator achieves lower prediction error despite using a biased imputation model.

New model predicts urban sprawl sensitivity from remote sensing data.

problem Forecasting urban sprawl sensitivity to economic factors.
method Physics-constrained conditional GANs for image-to-image translation.
result Model accurately predicts urban sprawl sensitivity without detailed data.

Meta-learning agents excel at rapidly learning new tasks from open-ended task distributions; yet, they forget what they learn about each task as soon as the next begins. When tasks reoccur - as they do in natural environments - metalearning agents must explore again instead of immediately exploiting previously discover…

2018-05-24abs ↗pdf ↗

The behavioral dynamics of multi-agent systems have a rich and orderly structure, which can be leveraged to understand these systems, and to improve how artificial agents learn to operate in them. Here we introduce Relational Forward Models (RFM) for multi-agent learning, networks that can learn to make accurate predic…

2018-09-28abs ↗pdf ↗

GALA framework learns invariant graph representations via environment augmentation with minimal assumptions.

problem Learning invariant graph representations from different environments without additional assumptions.
method Developed GALA framework with minimal assumptions of variation sufficiency and consistency. Uses an assistant model to differentiate graph environment changes.
result Extracting maximally invariant subgraphs to proxy predictions identifies underlying invariant subgraphs for successful out-of-distribution generalization.

Deep RL agent improves lane changing in unpredictable traffic.

problem Uncertainty in other drivers' behaviors and safety vs agility trade-off.
method Developed a deep reinforcement learning agent in a simulated highway environment.
result Significantly better performance in noisy environments compared to heuristic methods.

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.

Proposes ANN for more accurate path loss prediction in urban environments.

problem Inaccurate path loss prediction in complex urban environments.
method Artificial Neural Network (ANN) for multi-dimensional regression modeling of path loss.
result The proposed ANN model is more accurate and flexible than conventional linear models.

This work develops agents to learn generalizable policies for dynamic network environments.

problem Real-world network topologies change due to attackers, defenders, or system failures, leading to failures in adaptive ACD systems.
method Developing agents to learn generalizable policies across dynamic network environments.
result Agents can learn robust policies for dynamic network topologies and diverse attackers.

Develops model selection for bandits balancing adversarial and stochastic guarantees.

problem Model selection in bandit scenarios with simultaneous adversarial and stochastic high-probability regret.
method Nested policy classes, balanced candidate regret bounds, mis-specification tests.
result Best of both world guarantees in linear bandits with simultaneous adversarial and stochastic environments.

We describe theoretical bounds and a practical algorithm for teaching a model by demonstration in a sequential decision making environment. Unlike previous efforts that have optimized learners that watch a teacher demonstrate a static policy, we focus on the teacher as a decision maker who can dynamically choose differ…

2012-10-16abs ↗pdf ↗

Paper presents method for generating synthetic data to evaluate GPMs in complex environments.

problem Lack of realistic scenarios and datasets to evaluate GPMs in complex environments.
method Agile knowledge representation framework to model requirements and generate synthetic ground truth data.
result Synthetic data can be generated to robustly evaluate GPMs in complex environments.

New benchmark tests machine learning's ability to learn causal overhypotheses.

problem Machine learning's difficulty in understanding causal overhypotheses.
method Adapted blicket detector environment for machine learning agents to test causal overhypotheses.
result Many state-of-the-art methods struggle with causal overhypotheses in the new benchmark.

Safe-DRFS selects features robust to covariate shifts for reliable performance.

problem Feature selection fails in diverse deployment environments.
method Safe-DRFS extends safe screening to distributionally robust settings under covariate shift.
result Safe-DRFS identifies a feature subset encompassing optimal subsets across distribution shifts.

The design of robotic systems is largely dictated by our purely human intuition about how we perceive the world. This intuition has been proven incorrect with regard to a number of critical issues, such as visual change blindness. In order to develop truly autonomous robots, we must step away from this intuition and le…

2018-10-03abs ↗pdf ↗

Reinforcement learning (RL) agents optimize only the features specified in a reward function and are indifferent to anything left out inadvertently. This means that we must not only specify what to do, but also the much larger space of what not to do. It is easy to forget these preferences, since these preferences are …

2019-02-12abs ↗pdf ↗

The paper develops a method to learn navigation costs from expert demonstrations in partially observable environments.

problem Learning navigation costs from expert demonstrations in partially observable environments.
method Develops a cost function representation composed of a probabilistic occupancy encoder and a cost encoder, optimized by differentiating the error between demonstrated controls and a control policy computed from the cost encoder.
result The method outperforms baseline IRL algorithms in robot navigation tasks, improving both training and test-time efficiency.