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.

169,051 papers · 148 categories

Trend · papers per month

4386128171 · Jun 202019922001200920182026
48 results for reusable behavior

A new framework for adaptive behavior using reusable value profiles.

problem Adaptive behavior in changing environments requires switching among value-control regimes, but maintaining separate parameters for each situation is impractical.
method Introduces value profiles: reusable bundles of parameters assigned to hidden states, allowing for state-conditional strategy recruitment without independent parameters for each context.
result Profile-based models outperform simpler alternatives in probabilistic reversal learning, suggesting belief-dependent control of adaptive behavior.

CompILE learns reusable segments from demonstrations for hierarchical task execution.

problem Learning reusable, variable-length segments of hierarchical behavior from demonstrations.
method Unsupervised, fully-differentiable sequence segmentation module for latent encoding and re-composition.
result Model generalizes to longer sequences and unseen environments, learns task boundaries and event encodings.

MCP learns reusable skills for complex tasks by combining simple ones.

problem Learning complex tasks with many skills requires impractical amounts of data.
method Factorizes skills into primitives that can be combined multiplicatively.
result MCP can learn and reuse skills for novel tasks from pre-training.

The paper proposes reusable network components by making them compatible across tasks.

problem Training networks for different tasks independently leads to incompatible components.
method The paper splits a network into a features extractor and a target task head, and proposes various approaches to make them compatible.
result The proposed methods produce components that are directly compatible without compromising accuracy on original tasks.

MSPM uses modular agents to manage financial portfolios efficiently.

problem Scalability and reusability issues in RL-based financial portfolio management.
method Modular design with Evolving Agent Module (EAM) and Strategic Agent Module (SAM).
result MSPM improves profit accumulation by at least 186.5% compared to CRP.

This work explores how incorporating prior knowledge into reinforcement learning can lead to faster learning and transfer.

problem Challenging and diverse reinforcement learning tasks require better integration of prior knowledge.
method Exploits hierarchical structures in KL-regularized reinforcement learning to incorporate prior knowledge and facilitate transfer.
result Hierarchical structures can lead to faster learning and transfer in reinforcement learning tasks.

The paper examines how updates to probabilistic models influence behavior based on evidence.

problem Understanding how updates to probabilistic models influence behavior based on evidence.
method Study of KL-regularized soft updates as Bayesian posterior updates within a single probabilistic model.
result Posterior updates determine relative incentives but not absolute rewards, which are ambiguous up to context-specific baselines.

Generative model prices basket options efficiently.

problem Real-time pricing of basket options with varying market inputs.
method Truncated path signatures and Mixture Density Networks (MDN) for learning the terminal density.
result The model produces small pricing errors and matches Monte Carlo simulations closely.

CK simplifies ML model deployment and reproducibility with open APIs and DevOps.

problem Making ML models reproducible and deployable across different environments.
method Decompose complex systems into reusable sub-components with unified APIs and DevOps principles.
result Automatically co-design and optimize ML models for speed, accuracy, energy, and size.

The FAIRnets Ontology makes neural networks findable, accessible, interoperable, and reusable.

problem The resource-intensive training of neural networks and the lack of training data availability.
method Development of FAIRnets Ontology to model neural networks on a meta-level and creation of a knowledge graph (FAIRnets) of over 18,400 neural networks.
result The FAIRnets Ontology and knowledge graph enable the reuse and recommendation of neural networks to data scientists.

Successor Options discovers reusable skills using landmark states.

problem Discovering reusable skills in reinforcement learning.
method Leverages Successor Representations to build a state space model and learns intra-option policies using a novel pseudo-reward.
result Demonstrates the approach's efficacy on grid-worlds and high-dimensional robotic control environments.

Probabilistic inference procedures are usually coded painstakingly from scratch, for each target model and each inference algorithm. We reduce this effort by generating inference procedures from models automatically. We make this code generation modular by decomposing inference algorithms into reusable program-to-progr…

2016-03-06abs ↗pdf ↗

We develop a technique for generalising from data in which models are samplers represented as program text. We establish encouraging empirical results that suggest that Markov chain Monte Carlo probabilistic programming inference techniques coupled with higher-order probabilistic programming languages are now sufficien…

2014-07-09abs ↗pdf ↗

New method reduces fine-tuning cost for reused models.

problem Repeating fine-tuning costs with outdated foundation models.
method Portable Reward Tuning (PRT) trains a reward model to maximize the same loss function as fine-tuning.
result PRT achieves comparable accuracy to inference-time tuning with less inference cost.

Study allocates resources to strategic agents while balancing cost and incentives.

problem Dynamic allocation of reusable resources to strategic agents with private valuations under long-term cost constraints.
method Incentive-aware framework combining epoch-based lazy updates and randomized exploration rounds.
result Achieves ildeO(T) ilde{\mathcal{O}}(\sqrt{T}) social welfare regret, satisfies all cost constraints, and ensures incentive alignment.

Paper analyzes CRL generalization under non-i.i.d. settings, providing bounds for practical data reuse.

problem Limited theoretical understanding of CRL generalization under non-i.i.d. data conditions.
method Inspired by U-statistics, derives generalization bounds for CRL under non-i.i.d. settings.
result Required number of samples scales logarithmically with class covering number.

Auto-encoding is an important task which is typically realized by deep neural networks (DNNs) such as convolutional neural networks (CNN). In this paper, we propose EncoderForest (abbrv. eForest), the first tree ensemble based auto-encoder. We present a procedure for enabling forests to do backward reconstruction by ut…

2017-09-26abs ↗pdf ↗

In many real-world applications, data are often collected in the form of stream, and thus the distribution usually changes in nature, which is referred as concept drift in literature. We propose a novel and effective approach to handle concept drift via model reuse, leveraging previous knowledge by reusing models. Each…

2018-09-08abs ↗pdf ↗

The paper develops a learning framework for diverse legged robots.

problem General and autonomous learning of core skills in locomotion.
method Data-efficient, off-policy multi-task RL algorithm with semantically identical reward functions.
result The same algorithm can learn diverse and reusable locomotion skills across different legged robots.

Signed compression progress on a sealed audit is goodhart-resistant.

problem Intrinsic motivation for agents to improve their world models by compressing experience.
method Rewarding agents for the signed decrease of a fixed sealed-audit loss.
result Cumulative reward telescopes exactly to endpoint audit improvement, preventing infinite reward push while true audit performance stagnates.

Martingale Doppelgänger-Eval benchmarks VLMs on candlestick evidence vs. trend extrapolation

problem Auditing whether VLMs use chart evidence or trend extrapolation
method Proving formal limitations and designing controlled mechanisms
result Identifying regression coefficients for evidence vs. trend

New algorithm corrects bias in LDP-released data for better analysis.

problem Bias in data released under Local Differential Privacy (LDP).
method Inverse Weierstrass Private Stochastic Gradient Descent (IWP-SGD).
result Converges to true population risk minimizer at O(1/n)\mathcal{O}(1/n) rate.

Automated discovery of adaptive attacks improves adversarial defense evaluation.

problem Challenges in reliably evaluating adversarial defenses.
method Formalizes adaptive attacks as reusable building blocks in a search space for automatic discovery.
result Our tool discovers significantly stronger attacks than AutoAttack, improving adversarial defense evaluation.

ModSSC unifies semi-supervised classification for various data types.

problem Fragmented support for semi-supervised classification across different methods, settings, and data types.
method ModSSC is a modular Python framework that supports reproducible and controlled experimentation for semi-supervised classification on heterogeneous data.
result ModSSC enables systematic comparison of semi-supervised learning across various datasets and model backbones.

Several methods were recently proposed for the task of translating images between domains without prior knowledge in the form of correspondences. The existing methods apply adversarial learning to ensure that the distribution of the mapped source domain is indistinguishable from the target domain, which suffers from kn…

2018-06-03abs ↗pdf ↗

This paper analyzes and improves active learning techniques for real-world projects.

problem Reducing labelling effort in machine learning models with real-world constraints.
method Systematic study of active learning issues, proposing techniques to address model convergence, annotation error, and dataset imbalance.
result Presentation of two techniques to speed up active learning: partial uncertainty sampling and larger query size.

Framework reconstructs missing spatio-temporal data for extreme value prediction.

problem Predicting extreme values from incomplete spatio-temporal data.
method Convolutional deep neural networks and autoencoder-like models for conditional sampling.
result Framework produces accurate reconstructions of missing data for extremal values.

New method learns temporal abstractions by defining interest functions.

problem Learning temporal abstractions with limited, variable durations.
method Introduced interest functions to define initiation sets, enabling gradient-based learning.
result Demonstrated effectiveness in discrete and continuous environments.

Unified approach for learning state representations from streaming data.

problem Learning reusable state representations from high-dimensional, non-stationary data.
method Unified mathematical formulation for learning latent relations, enabling flexible and principled shaping of latent space.
result Improved understanding and evaluation of existing unsupervised learning approaches.