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

25.0%50.0%75.0%100.0% · Feb 199419922001200920172026
48 results for model re-use

New insights into neural network forgetting reveal a trade-off between node activation and re-use.

problem Challenges in maintaining performance on old tasks while learning new ones.
method Theoretical analysis of synthetic and real data setups, focusing on node activation vs re-use.
result Worst forgetting occurs in an intermediate similarity regime between learned tasks.

Algorithm finds best mixture of training datasets for improved validation performance.

problem Learning from mixture distributions with covariate shift.
method Combines SGD with optimistic tree search and model re-use over mixture space.
result Proves simple regret guarantees for recovering optimal mixture.

Traditional statistical theory assumes that the analysis to be performed on a given data set is selected independently of the data themselves. This assumption breaks downs when data are re-used across analyses and the analysis to be performed at a given stage depends on the results of earlier stages. Such dependency ca…

2017-06-02abs ↗pdf ↗

Mobile devices learn audio representations using self-supervised methods.

problem Learning general-purpose audio representations on mobile devices.
method Temporal context exploitation in spectrogram domain, inspired by Word2Vec.
result Self-supervised models can produce embeddings that perform similarly to fully supervised models.

We present an embedding of stochastic optimal control problems, of the so called path integral form, into reproducing kernel Hilbert spaces. Using consistent, sample based estimates of the embedding leads to a model free, non-parametric approach for calculation of an approximate solution to the control problem. This fo…

2012-08-13abs ↗pdf ↗

We build new test sets for the CIFAR-10 and ImageNet datasets. Both benchmarks have been the focus of intense research for almost a decade, raising the danger of overfitting to excessively re-used test sets. By closely following the original dataset creation processes, we test to what extent current classification mode…

2019-02-13abs ↗pdf ↗

The paper proposes a method to transfer skills between tasks using disentangled latent policies.

problem Transfer learning in reinforcement learning struggles with diverse tasks without explicit supervision.
method Learning a small set of policies in a disentangled latent space that can be recombined to solve many tasks.
result Disentangled latent policies enable quick performance on many diverse tasks.

We introduce the Mondrian kernel, a fast random feature approximation to the Laplace kernel. It is suitable for both batch and online learning, and admits a fast kernel-width-selection procedure as the random features can be re-used efficiently for all kernel widths. The features are constructed by sampling trees via a…

2016-06-16abs ↗pdf ↗

New framework boosts neural network performance and resilience.

problem Susceptibility of compact neural network implementations to system disturbances.
method Realistic crossbar simulations and Mosaics framework to re-use synaptic connections.
result Compact neural networks are noise-immune and perform well under disturbances.

We study the complexity of functions computable by deep feedforward neural networks with piecewise linear activations in terms of the symmetries and the number of linear regions that they have. Deep networks are able to sequentially map portions of each layer's input-space to the same output. In this way, deep models c…

2014-02-08abs ↗pdf ↗

We propose to prune a random forest (RF) for resource-constrained prediction. We first construct a RF and then prune it to optimize expected feature cost & accuracy. We pose pruning RFs as a novel 0-1 integer program with linear constraints that encourages feature re-use. We establish total unimodularity of the constra…

2016-06-16abs ↗pdf ↗

Study confirms eurozone interbank market stability but finds higher collateral reuse.

problem Analyzing eurozone interbank market behavior and stability.
method Examined secured transactions data from ECB, tested stylized facts, measured network properties.
result Observed higher collateral reuse and network symmetry compared to unsecured markets.

C-OPH improves One Permutation Hashing by using a shorter circulant permutation.

problem Improving the accuracy of One Permutation Hashing (OPH) for Jaccard similarity estimation.
method Develops a new densification method using a shorter circulant permutation.
result Achieves the smallest estimation variance for Jaccard similarity.

Dataset augmentation, the practice of applying a wide array of domain-specific transformations to synthetically expand a training set, is a standard tool in supervised learning. While effective in tasks such as visual recognition, the set of transformations must be carefully designed, implemented, and tested for every …

2017-02-17abs ↗pdf ↗

Stochastic Gradient Descent (SGD) is a workhorse in machine learning, yet its slow convergence can be a computational bottleneck. Variance reduction techniques such as SAG, SVRG and SAGA have been proposed to overcome this weakness, achieving linear convergence. However, these methods are either based on computations o…

2015-06-11abs ↗pdf ↗

Study evaluates how well question-answering models generalize to new data types.

problem Generalization of question-answering models to new data types.
method Constructed new test sets from different domains and evaluated models' performance.
result Models show significant performance drops when tested on new data types.

The study uses supervised learning to classify research data by discipline.

problem Automatically categorizing research data by discipline for scientometric analysis.
method Used a large dataset of 609,524 records for training and evaluation, employing tree-based models and neural networks.
result Multi-layer perceptron models outperformed Long Short-Term Memory models in multi-label classification tasks.

Study measures impact of data and neural net similarity on transferability in restaurant sales data.

problem Identify indicators for successful transferability of neural nets across different data sets.
method Empirical study on sales data from six restaurants, calculating indicators based on data and neural net similarities.
result Negative correlations between transferability and indicators, allowing better model performance and fewer transfers.

We address the problem of Bayesian structure learning for domains with hundreds of variables by employing non-parametric bootstrap, recursively. We propose a method that covers both model averaging and model selection in the same framework. The proposed method deals with the main weakness of constraint-based learning--…

2018-09-13abs ↗pdf ↗

Two approaches extend knowledge distillation to Gaussian Processes, showing relationships to existing methods.

problem Applying knowledge distillation to Gaussian Processes for regression and classification.
method Data-centric and distribution-centric approaches to extend distillation to GPR and GPC.
result Distribution-centric approach for GPC approximately corresponds to data duplication and scaling.

This work proposes splitting deep neural networks into smaller sub-networks for faster and more efficient distillation.

problem Challenges in training deep neural networks, including local optima, gradient issues, and computational demands.
method Proposes a non-end-to-end distillation approach by splitting networks into smaller, independent sub-networks (neighbourhoods).
result Independent training of smaller sub-networks can speed up distillation and improve efficiency in various applications.

Efficiently models Wrong-Way Risk in FVA without full Monte Carlo.

problem Assessing Wrong-Way Risk in Funding Valuation Adjustments (FVA) without extensive simulations.
method Splitting exposure into independent and WWR-driven parts; approximating WWR-driven part using Gaussian stochastic factor.
result An efficient and robust method to include WWR in FVA modelling.

The effectiveness of Convolutional Neural Networks stems in large part from their ability to exploit the translation invariance that is inherent in many learning problems. Recently, it was shown that CNNs can exploit other invariances, such as rotation invariance, by using group convolutions instead of planar convoluti…

2018-03-06abs ↗pdf ↗

DeepClean detects and removes artefacts from ICU waveform data.

problem Accurate removal of artefacts from ICU waveform data reduces bias and uncertainty in clinical assessment.
method Self-supervised deep generative learning using a convolutional variational autoencoder.
result DeepClean detects artefacts with high sensitivity and specificity, significantly outperforming baseline methods.

BERT models can classify multilingual party manifestos across different dimensions.

problem Costly manual annotation of large corpora in social science.
method Domain transfer across geographical locations, languages, time, and genre using fine-tuned transformer models.
result BERT models can be applied to future data with similar performance.

A new method compares image classifiers using adaptive sampling of natural images.

problem Evaluation of image classifiers on small, fixed test sets may not generalize to real-world images.
method Adaptive sampling from a large corpus of unlabeled images to maximize classifier discrepancies measured by WordNet hierarchy.
result Human labeling of model-dependent image sets reveals relative classifier performance.

C-MinHash reduces the number of permutations needed for MinHash from thousands to just two.

problem Approximating Jaccard similarity in large binary datasets using many permutations.
method Initial permutation followed by circulant shifting of a second permutation to generate hashes.
result C-MinHash achieves unbiased Jaccard similarity estimation with uniformly smaller variance.

The paper explores how agents can generalize to new environments with unseen variables.

problem Generalizing to new environments with unseen variables.
method Investigates and proposes a method for efficient re-use of past marginal information to achieve out-of-variable generalization.
result The residual distribution after fitting a classifier reveals partial derivatives of the true generating function with respect to unobserved causal parents.

New framework for modular reinforcement learning reduces sample complexity.

problem Achieving independent credit assignment in reinforcement learning.
method Defining modular credit assignment as minimizing algorithmic mutual information, introducing modularity criterion for causal analysis.
result Single-step temporal difference action-value methods meet the modularity criterion, improving sample efficiency.

Agent learns diverse hierarchical structures in unknown environments.

problem Autonomous discovery and learning of diverse structures in unknown changing environments.
method Progressive construction of a Hierarchy of Observation Latent Models for Exploration Stratification (HOLMES).
result Agent can learn and reuse representations to progressively explore and discover diverse structures.

Framework uses diffusion models to infer material properties from noisy mechanical measurements.

problem Inference of spatially varying material properties from noisy mechanical responses.
method Conditional score-based diffusion models approximating the score function of a conditional distribution.
result Framework can efficiently solve large-scale physics-based inverse problems.

The paper introduces sanity tests to detect spurious correlations in AI-guided radiology systems.

problem Detecting when AI systems perform well on development data for the wrong reasons.
method Design and implementation of sanity tests to identify spurious correlations.
result Sanity tests can identify spurious correlations in AI-guided radiology systems.

Two-layer networks learn faster with batch reuse, overcoming information and leap exponents.

problem Limitations of gradient flow and single-pass GD in learning multi-index target functions.
method Multi-pass gradient descent that reuses batches, analyzed using Dynamical Mean-Field Theory.
result Two-time-step overlap with target subspace for non-staircase functions, overcoming information and leap exponents.