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

Trend · papers per month

219438656875 · Jun 202019922001200920172026
48 results for agile algorithms

A drone catches another agile drone using competitive reinforcement learning.

problem Intercepting an agile drone with another agile drone.
method Formulated as a Competitive Reinforcement Learning problem, trained with PPO, using a high-fidelity simulation environment.
result Trained policies outperform common heuristic baselines in catch rate, time to catch, and crash rate.

New algorithm reduces adaptation lag in online model selection.

problem Adaptation lag in online model selection for non-stationary environments.
method Optimistic online mirror descent with safeguarded large learning rates.
result Reduces adaptation lag from hundreds of rounds to a few rounds.

Replication study shows Deep-SE still not as effective as previously thought for agile effort estimation.

problem Improving accuracy in estimating agile software development effort.
method Close replication of Deep-SE using additional data and comparison with multiple baselines.
result Deep-SE outperforms only a few cases, suggesting more work is needed.

Aux-Net model handles dynamic systems with inconsistent inputs.

problem Inconsistent or unreliable input data in real-world scenarios.
method Aux-Net uses a weighted ensemble of classifiers and online gradient descent.
result Aux-Net provides scalable and agile online learning for dynamic systems.

Robots' agility in changing terrain helps financial models adapt to market shifts.

problem Challenges in financial market forecasting due to regime switching.
method Adapts pretrained LLMs using intrinsic market rewards and reinforcement learning.
result Significantly improved accuracy in adapting to market regime shifts.

Legged robots pose one of the greatest challenges in robotics. Dynamic and agile maneuvers of animals cannot be imitated by existing methods that are crafted by humans. A compelling alternative is reinforcement learning, which requires minimal craftsmanship and promotes the natural evolution of a control policy. Howeve…

2019-01-24abs ↗pdf ↗

Motion planning and control are key problems in a collection of robotic applications including the design of autonomous agile vehicles and of minimalist manipulators. These problems can be accurately formalized within the language of affine connections and of geometric control theory. In this paper we overview recent r…

2002-09-17abs ↗pdf ↗

Machine and reinforcement learning (RL) are increasingly being applied to plan and control the behavior of autonomous systems interacting with the physical world. Examples include self-driving vehicles, distributed sensor networks, and agile robots. However, when machine learning is to be applied in these new settings,…

2019-06-27abs ↗pdf ↗

In many applications the process of generating label information is expensive and time consuming. We present a new method that combines active and semi-supervised deep learning to achieve high generalization performance from a deep convolutional neural network with as few known labels as possible. In a setting where a …

2018-03-03abs ↗pdf ↗

RFC enhances humanoid control to imitate complex human motions.

problem Dynamics mismatch between humanoid models and real humans.
method Residual Force Control (RFC) augments control policies with external forces.
result RFC outperforms state-of-the-art methods in convergence speed and motion quality.

We study the problem of safe learning and exploration in sequential control problems. The goal is to safely collect data samples from operating in an environment, in order to learn to achieve a challenging control goal (e.g., an agile maneuver close to a boundary). A central challenge in this setting is how to quantify…

2019-06-13abs ↗pdf ↗

Enhanced network threat detection using KG, LLM, and imbalanced learning.

problem Challenges in network threat detection due to complex attack patterns and limited historical data.
method Integrated framework combining Knowledge Graph, Imbalanced Learning, and Large Language Model.
result Improved threat capture rate by 3%-4% and increased interpretability of risk predictions.

We investigate how an adversary can optimally use its query budget for targeted evasion attacks against deep neural networks in a black-box setting. We formalize the problem setting and systematically evaluate what benefits the adversary can gain by using substitute models. We show that there is an exploration-exploita…

2019-06-08abs ↗pdf ↗

Although there has been substantial research in software analytics for effort estimation in traditional software projects, little work has been done for estimation in agile projects, especially estimating user stories or issues. Story points are the most common unit of measure used for estimating the effort involved in…

2016-09-02abs ↗pdf ↗

RAPTOR-GEN accelerates digital twin development for biopharmaceuticals.

problem Lack of agility in rapid, on-demand production of biotherapeutics due to bioprocess complexity.
method Bayesian learning framework based on a multi-scale probabilistic knowledge graph (pKG) and stochastic differential equations (SDE).
result RAPTOR-GEN accelerates intelligent digital twin development from sparse and heterogeneous experimental data.

A typical domain adaptation approach is to adapt models trained on the annotated data in a source domain (e.g., sunny weather) for achieving high performance on the test data in a target domain (e.g., rainy weather). Whether the target contains a single homogeneous domain or multiple heterogeneous domains, existing wor…

2019-09-08abs ↗pdf ↗

The paper explores how innovative financing solutions boost Moroccan businesses' performance.

problem Market volatility, ecological transitions, and technological change pose challenges to business sustainability.
method Examines innovative financing solutions like venture capital, green finance, crowdfunding, and blockchain.
result Embracing innovative financial strategies can transform business challenges into opportunities.

ROBEL is an open-source platform of cost-effective robots designed for reinforcement learning in the real world. ROBEL introduces two robots, each aimed to accelerate reinforcement learning research in different task domains: D'Claw is a three-fingered hand robot that facilitates learning dexterous manipulation tasks, …

2019-09-25abs ↗pdf ↗

FinRL-Podracer accelerates DRL trading strategies in finance with high performance and scalability.

problem Challenges in applying deep reinforcement learning to finance trading models.
method Proposes an RLOps framework and high-performance cloud solution for DRL trading.
result FinRL-Podracer outperforms existing DRL libraries by 12-35% in annual return, 0.1-0.6 in Sharpe ratio, and 3-7 times in training time.

FinMem enhances LLM trading agents with layered memory and character design.

problem Developing purpose-driven LLM agents for financial decision-making.
method Integrates layered memory and character design modules into an LLM framework.
result Significantly enhanced trading performance in financial markets.

Adaptive beamforming collapses in highly non-stationary environments, but the Universal Switching Beamformer resolves this by dynamically adjusting memory length.

problem Adaptive beamforming performance degrades in highly non-stationary environments.
method Integrating sequential prediction into the beamforming architecture.
result The USB achieves agility and precision in tracking highly non-stationary scenes.

Develops a universal waveform selection scheme for radar tracking.

problem Optimal waveform selection for target tracking in active sensors.
method Uses reinforcement learning and universal source coding techniques.
result Achieves optimal waveform selection for any radar scene modeled as a Markov process.

Paper optimizes UAV navigation for IoT data freshness and energy efficiency.

problem Improving data freshness and connectivity for IoT devices with UAVs.
method Deep reinforcement learning model with experience replay for energy-efficient UAV trajectory optimization.
result The proposed approach is 3.6% and 3.13% more energy efficient than greedy and baseline methods.

Neural process model improves real-time condition monitoring signal prediction.

problem Real-time adaptation for complex condition monitoring signals.
method Label-aware neural processes encoding and reconstruction.
result Advantages in real-time adaptation, enhanced signal prediction with uncertainty quantification, and joint prediction for labels and signals.

Physics-informed neural networks improve surrogate modeling of turbulent Rayleigh-Bénard convection.

problem Modeling turbulent Rayleigh-Bénard convection with high accuracy and efficiency.
method Physics-informed neural networks (PINNs) with novel padding and regularization techniques.
result Significantly improved predictive accuracy of surrogate models at high Rayleigh numbers Ra = 2 × 10^9.

Supplier learns to price contracts against a learning retailer.

problem Designing data-driven pricing policies for a supplier facing a learning retailer.
method Connecting to non-stationary online learning, proposing dynamic pricing policies for discrete and continuous demand.
result Supplier's pricing policies lead to sublinear regret bounds under various retailer learning policies.

Examines algorithmic modeling across three cultures.

problem Tackles algorithmic modeling in different cultural contexts.
method Uses parametric regressions, interpretable algorithms, and complex algorithms.
result Extension of Leo Breiman's thesis to include cultural differences.

Playing repeated matrix games (RMG) while maximizing the cumulative returns is a basic method to evaluate multi-agent learning (MAL) algorithms. Previous work has shown that UCBUCB, M3M3, SS or Exp3Exp3 algorithms have good behaviours on average in RMG. Besides, hedging algorithms have been shown to be effective on predi…

2018-10-15abs ↗pdf ↗

Meta-algorithm selection aims to choose the best algorithm selector for a given problem instance.

problem Selecting the best algorithm selector for a specific problem instance.
method Apply algorithm selection to the selection of other algorithms (meta-algorithm selection).
result Meta-algorithm selection can be beneficial in some cases but faces challenges in solving the meta-level problem.

Combines multiple bandit algorithms to create a nearly optimal single algorithm.

problem Designing a single bandit algorithm that performs nearly as well as the best individual algorithm in a stochastic environment.
method Develops two general corralling algorithms that achieve favorable regret guarantees.
result The regret of the corralling algorithms is no worse than the best individual algorithm's performance.

The exchange algorithm is studied for its convergence and asymptotic variance.

problem Theoretical limitations of the exchange algorithm in sampling from doubly-intractable distributions.
method Theoretical analysis of the exchange algorithm's convergence speed and asymptotic variance.
result The exchange algorithm converges at a geometric rate and satisfies a Central Limit Theorem.