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

53106158211 · Jun 202019922001200920172026
48 results for reusable knowledge

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 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.

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 ↗

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.

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.

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.

Research on neural networks has gained significant momentum over the past few years. Because training is a resource-intensive process and training data cannot always be made available to everyone, there has been a trend to reuse pre-trained neural networks. As such, neural networks themselves have become research data.…

2019-07-26abs ↗pdf ↗

The design of gaits for robot locomotion can be a daunting process which requires significant expert knowledge and engineering. This process is even more challenging for robots that do not have an accurate physical model, such as compliant or micro-scale robots. Data-driven gait optimization provides an automated alter…

2018-03-01abs ↗pdf ↗

As reinforcement learning agents are tasked with solving more challenging and diverse tasks, the ability to incorporate prior knowledge into the learning system and to exploit reusable structure in solution space is likely to become increasingly important. The KL-regularized expected reward objective constitutes one po…

2019-03-18abs ↗pdf ↗

Unified scoring model improves efficiency and performance across multiple tasks.

problem Efficient and resource-efficient automated scoring for diverse tasks.
method Knowledge-distilled multi-task Mixture-of-Experts (MoE) approach.
result Comparable performance to task-specific models with significantly less storage and training resources.

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 ↗

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.

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.

Bayesian model enhances phenotype discovery in asthma EHRs.

problem Lack of interpretability in unsupervised learning phenotyping of EHR data.
method Operationalized a Bayesian latent class framework with clinical knowledge priors.
result Identified an asthma sub-phenotype with elevated eosinophil levels and allergy markers.

Shai-am simplifies ML for finance, solving code structure and scalability issues.

problem Challenges in integrating ML for investment strategies, including code structure and scalability.
method Integrates a Python framework with modern open-source technologies to manage containerized pipelines and unified interfaces.
result Facilitates collaborative work in quantitative finance by enhancing reusability and readability.

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 memory allocation scheme improves image generation performance.

problem Improving episodic and semantic memory representation in neural networks.
method Developed a hierarchical latent variable model with differentiable, locally block allocated latent memory.
result Improved conditional likelihood values on various datasets.

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 ↗

Lean 4 library formalizes mathematical finance, verifying over 200 theorems.

problem Formal verification of complex financial mathematics.
method Lean 4 proof assistant, Mathlib, BrownianMotion package, formal verification of over 200 theorems.
result Formal verification yields certified unification of known financial results.

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.

With a view to bridging the gap between deep learning and symbolic AI, we present a novel end-to-end neural network architecture that learns to form propositional representations with an explicitly relational structure from raw pixel data. In order to evaluate and analyse the architecture, we introduce a family of simp…

2019-05-24abs ↗pdf ↗

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.

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.

Many real world tasks exhibit rich structure that is repeated across different parts of the state space or in time. In this work we study the possibility of leveraging such repeated structure to speed up and regularize learning. We start from the KL regularized expected reward objective which introduces an additional c…

2019-05-03abs ↗pdf ↗

Temporal abstraction refers to the ability of an agent to use behaviours of controllers which act for a limited, variable amount of time. The options framework describes such behaviours as consisting of a subset of states in which they can initiate, an internal policy and a stochastic termination condition. However, mu…

2020-01-01abs ↗pdf ↗

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.

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.

We introduce Compositional Imitation Learning and Execution (CompILE): a framework for learning reusable, variable-length segments of hierarchically-structured behavior from demonstration data. CompILE uses a novel unsupervised, fully-differentiable sequence segmentation module to learn latent encodings of sequential d…

2018-12-04abs ↗pdf ↗

In this paper, we propose Continuous Graph Flow, a generative continuous flow based method that aims to model complex distributions of graph-structured data. Once learned, the model can be applied to an arbitrary graph, defining a probability density over the random variables represented by the graph. It is formulated …

2019-08-07abs ↗pdf ↗

Many real-world problems, including multi-speaker text-to-speech synthesis, can greatly benefit from the ability to meta-learn large models with only a few task-specific components. Updating only these task-specific modules then allows the model to be adapted to low-data tasks for as many steps as necessary without ris…

2019-09-12abs ↗pdf ↗