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

228456684912 · Jun 202019922001200920172026
48 results for Training Strategies

Parallel neural network training yields better long-term prediction accuracy.

problem Choosing the right training strategy for neural networks in dynamical systems.
method Comparison of parallel and series-parallel training strategies on five neural network architectures and two examples.
result Parallel training consistently outperforms series-parallel training in long-term prediction accuracy.

Support Vector Machines (SVMs) can solve structured multi-output learning problems such as multi-label classification, multiclass classification and vector regression. SVM training is expensive especially for large and high dimensional datasets. The bottleneck of the SVM training often lies in the kernel value computat…

2019-11-08abs ↗pdf ↗

In this paper we introduce Curriculum GANs, a curriculum learning strategy for training Generative Adversarial Networks that increases the strength of the discriminator over the course of training, thereby making the learning task progressively more difficult for the generator. We demonstrate that this strategy is key …

2018-07-24abs ↗pdf ↗

TensorOpt finds optimal parallelization strategies for DNN training.

problem Finding efficient parallelization strategies for DNN training.
method TensorOpt uses an algorithm (FT) to search for an optimal set of parallelization strategies considering multiple objectives.
result TensorOpt provides accurate runtime cost estimation and adapts to resource availability.

Many applications of machine learning require a model to make accurate pre-dictions on test examples that are distributionally different from training ones, while task-specific labels are scarce during training. An effective approach to this challenge is to pre-train a model on related tasks where data is abundant, and…

2019-05-29abs ↗pdf ↗

New method learns adaptive exploration strategies for dynamic tasks.

problem Learning effective exploration strategies in changing environments.
method Informed policy regularization to reduce sample complexity of RNN-based policies.
result Method learns efficient exploration strategies balancing information gathering and reward maximization.

This study optimizes trading strategy parameters using walk-forward techniques and finds robust performance.

problem Optimizing trading strategy performance through parameter optimization.
method Walk-forward optimization with varying window lengths, tested on Bitcoin, Binance Coin, and Ethereum.
result The strategy outperforms Buy-and-Hold with lower drawdown and higher Information Ratio.

An important part of Digital Pathology is the analysis of multiple digitised whole slide images from differently stained tissue sections. It is common practice to mount consecutive sections containing corresponding microscopic structures on glass slides, and to stain them differently to highlight specific tissue compon…

2018-10-17abs ↗pdf ↗

Deep learning improves portfolio optimization in volatile markets.

problem Challenges in long-only, multi-asset strategies across market cycles.
method Training DL models with limited regime data using pre-training techniques and transformer architectures.
result Models show resilience and improved predictive accuracy in volatile markets.

Algorithms for equilibrium computation generally make no attempt to ensure that the computed strategies are understandable by humans. For instance the strategies for the strongest poker agents are represented as massive binary files. In many situations, we would like to compute strategies that can actually be implement…

2016-12-19abs ↗pdf ↗

Stock trading strategy plays a crucial role in investment companies. However, it is challenging to obtain optimal strategy in the complex and dynamic stock market. We explore the potential of deep reinforcement learning to optimize stock trading strategy and thus maximize investment return. 30 stocks are selected as ou…

2018-11-19abs ↗pdf ↗

Mini-batch gradient descent based methods are the de facto algorithms for training neural network architectures today. We introduce a mini-batch selection strategy based on submodular function maximization. Our novel submodular formulation captures the informativeness of each sample and diversity of the whole subset. W…

2019-06-20abs ↗pdf ↗

Training examples are not all equally informative. Active learning strategies leverage this observation in order to massively reduce the number of examples that need to be labeled. We leverage the same observation to build a generic strategy for parallelizing learning algorithms. This strategy is effective because the …

2013-10-30abs ↗pdf ↗

New method trains shallow neural networks with subquadratic width scaling.

problem Training shallow neural networks with optimal width scaling.
method Polyak-Lojasiewicz condition, smoothness, standard data assumptions, random matrix theory.
result Subquadratic scaling on network width with standard initialization strategies.

Credit scoring models support loan approval decisions in the financial services industry. Lenders train these models on data from previously granted credit applications, where the borrowers' repayment behavior has been observed. This approach creates sample bias. The scoring model (i.e., classifier) is trained on accep…

2019-09-13abs ↗pdf ↗

PES method reduces bias in gradient estimation for unrolled graphs.

problem High variance and bias in gradient estimation for unrolled computation graphs.
method Divide graph into unrolls, apply ES update, accumulate correction terms.
result PES provides unbiased, low-variance gradient estimates.

DBS dynamically adjusts batch sizes to improve cluster utilization.

problem Inefficient use of high-performance workers in synchronous distributed training.
method Dynamic Batch Size (DBS) strategy that adjusts batch size and dataset partition based on worker performance.
result Significantly improves cluster utilization and reduces training time.

Deep RL ensemble strategy outperforms individual algorithms in stock trading.

problem Designing profitable stock trading strategies in a complex market.
method Ensemble of three deep reinforcement learning algorithms (PPO, A2C, DDPG) for stock trading.
result Deep ensemble strategy outperforms individual algorithms and traditional min-variance portfolio.

ARL and Hawkes processes improve market-making strategies with variable volatility.

problem Enhancing market-making strategies to adapt to varying volatility levels and self-exciting behaviors.
method Integrates ARL, Hawkes processes, and variable volatility levels; shifts from Poisson to Hawkes process.
result 4-action MM trained in low-volatility environment adapts to high-volatility conditions, providing stable performance.

New method improves deep learning models in noisy label classification.

problem Improving deep learning models in noisy label classification.
method Analyzes loss and uncertainty changes during training, designs a new robust training method.
result Significantly outperforms other state-of-the-art methods in various deep learning models.

Study compares data-driven vs model-based MRS quantification strategies, focusing on resilience to out-of-distribution effects.

problem Resilience to out-of-distribution effects in data-driven MRS quantification.
method Compared three data-driven strategies (supervised regression, self-supervised learning, test-time adaptation) against model-based fitting tools.
result Test-time adaptation proved most resilient to out-of-distribution effects, while self-supervised learning achieved intermediate performance.

Adaptive batch sizes improve local gradient methods in distributed training.

problem Communication bottlenecks in distributed deep learning.
method Adaptive batch size strategies for local gradient methods.
result Adaptive batch sizes reduce minibatch gradient variance and improve training efficiency.

Sampling strategies significantly affect feature approximations in ELA, impacting classifier accuracy.

problem The impact of sampling strategies on feature approximations in ELA.
method Analysis of feature approximations from different sampling strategies and sample sizes.
result Feature approximations from different sampling strategies do not converge, affecting classifier accuracy.

AdAdaGrad optimizes batch sizes for deep learning models, reducing the generalization gap.

problem The generalization gap between large-batch and small-batch training in deep learning.
method AdAdaGrad introduces adaptive batch size strategies derived from adaptive sampling methods.
result AdAdaGradNorm converges to a first-order stationary point with a rate of O(1/K) in K iterations.

Study evaluates federated learning with differential privacy on MIMIC-III, improving model performance with careful parameter tuning.

problem Training machine learning models on privacy-sensitive data sets locked in healthcare facilities.
method Extensive evaluation of federated and differential privacy techniques on MIMIC-III dataset, analyzing various parameters.
result Careful parameter tuning is crucial for federated learning with differential privacy, especially for data distribution and communication strategies.

New model uses pretrained biochemical language models to generate drug compounds.

problem Developing novel compounds targeting specific proteins.
method Exploits pretrained language models to initialize and fine-tune targeted molecule generation models.
result Warm-started models outperform baseline models, with one-stage strategy showing better generalization.

We investigate different strategies for active learning with Bayesian deep neural networks. We focus our analysis on scenarios where new, unlabeled data is obtained episodically, such as commonly encountered in mobile robotics applications. An evaluation of different strategies for acquisition, updating, and final trai…

2017-03-21abs ↗pdf ↗

Meta-learning strategy improves few-shot classification performance.

problem Few-shot classification with deep neural networks struggles when labeled samples are limited.
method Proposes an easy-to-hard expert meta-training strategy to arrange training tasks based on task hardness.
result Meta-learners achieve better results with the proposed expert training strategy.

The infinite restricted Boltzmann machine (iRBM) is an extension of the classic RBM. It enjoys a good property of automatically deciding the size of the hidden layer according to specific training data. With sufficient training, the iRBM can achieve a competitive performance with that of the classic RBM. However, the c…

2017-09-11abs ↗pdf ↗

Stochastic neighbor embedding (SNE) and related nonlinear manifold learning algorithms achieve high-quality low-dimensional representations of similarity data, but are notoriously slow to train. We propose a generic formulation of embedding algorithms that includes SNE and other existing algorithms, and study their rel…

2012-06-18abs ↗pdf ↗

Machine-learned diagnosis models have shown promise as medical aides but are trained under a closed-set assumption, i.e. that models will only encounter conditions on which they have been trained. However, it is practically infeasible to obtain sufficient training data for every human condition, and once deployed such …

2019-10-07abs ↗pdf ↗