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

209418626835 · Jun 202019922001200920172026
48 results for terminal training phase

Deep nets exhibit 'Neural Collapse' during training's final phase, simplifying decision-making.

problem Understanding and optimizing deep learning training phases.
method Direct measurements on three deepnet architectures across seven datasets.
result Deep nets exhibit 'Neural Collapse' during training's final phase, simplifying decision-making.

Paper proposes a deep RL method for hedging variable annuities, outperforming misspecified models.

problem Model miscalibration in variable annuity contracts with GMMB and GMDB riders.
method Two-phase deep reinforcement learning approach: training phase in a controlled environment, online learning phase in real market.
result Trained reinforcement learning agent hedges equally well as correct Delta in training phase and outperforms misspecified Deltas.

Optimal asset allocation strategy outperforms stochastic benchmark.

problem Achieving higher terminal wealth than a stochastic benchmark.
method Data-driven Neural Network optimization framework for dynamic asset allocation.
result Optimal adaptive strategy outperforms benchmark with higher median and right-skewed terminal wealth.

New loss function improves classification for imbalanced and sensitive groups.

problem Optimizing metrics like balanced error and equal opportunity in imbalanced and sensitive classification.
method Developed a principled vector-scaling (VS) loss function that addresses multiplicative adjustments necessary at terminal training phase.
result The VS loss function improves minority class performance and generalizes to different types of imbalances.

This paper simplifies fine-tuning for small LLMs, reducing barriers for developers.

problem Limited resources for fine-tuning large language models (LLMs) by individual developers and small organizations.
method Instruction-tuning datasets, small-sized LLMs (3B to 7B parameters), various training configurations and strategies.
result Improved model performance on benchmarks with specific training configurations, and insights into early termination and hyperparameter simplifications.

In this paper, the `Approximate Message Passing' (AMP) algorithm, initially developed for compressed sensing of signals under i.i.d. Gaussian measurement matrices, has been extended to a multi-terminal setting (MAMP algorithm). It has been shown that similar to its single terminal counterpart, the behavior of MAMP algo…

2014-01-11abs ↗pdf ↗

We consider an interest rate model with log-normally distributed rates in the terminal measure in discrete time. Such models are used in financial practice as parametric versions of the Markov functional model, or as approximations to the log-normal Libor market model. We show that the model has two distinct regimes, a…

2011-04-02abs ↗pdf ↗

We consider the class of short rate interest rate models for which the short rate is proportional to the exponential of a Gaussian Markov process x(t) in the terminal measure r(t) = a(t) exp(x(t)). These models include the Black, Derman, Toy and Black, Karasinski models in the terminal measure. We show that such intere…

2012-04-04abs ↗pdf ↗

In this work, we consider the problem of autonomously discovering behavioral abstractions, or options, for reinforcement learning agents. We propose an algorithm that focuses on the termination condition, as opposed to -- as is common -- the policy. The termination condition is usually trained to optimize a control obj…

2019-02-26abs ↗pdf ↗

Applicability of the concept of financial log-periodicity is discussed and encouragingly verified for various phases of the world stock markets development in the period 2000-2010. In particular, a speculative forecasting scenario designed in the end of 2004, that properly predicted the world stock market increases in …

2008-02-27abs ↗pdf ↗

Paper explains neural collapse in neural networks using a new model.

problem Understanding neural collapse in neural networks during training.
method Introducing the unconstrained layer-peeled model (ULPM) to prove gradient flow convergence to critical points of a minimum-norm separation problem.
result Proves that all critical points are strict saddle points except the global minimizers exhibiting neural collapse.

Humans tend to learn complex abstract concepts faster if examples are presented in a structured manner. For instance, when learning how to play a board game, usually one of the first concepts learned is how the game ends, i.e. the actions that lead to a terminal state (win, lose or draw). The advantage of learning end-…

2019-03-29abs ↗pdf ↗

Survive method improves model-based RL by avoiding terminal states, reducing sample complexity.

problem High sample complexity in model-free RL methods limits real-world applications.
method Introduces 'survival' concept to model-based RL, focusing on avoiding terminal states instead of maximizing rewards.
result Survive method reduces training effort by focusing on terminal states, improving model-based RL performance.

Adaptive algorithm identifies best arm with abstention, showing phase transition from polynomial to exponential error probability.

problem Bayesian best-arm identification with abstention to reduce undetected error.
method Adaptive algorithm PGWS that optimally uses abstention budget.
result Introducing any positive abstention budget induces an exponential decay in undetected error probability.

In this work we investigate approaches to reconstruct generator models from measurements available at the generator terminal bus using machine learning (ML) techniques. The goal is to develop an emulator which is trained online and is capable of fast predictive computations. The training is illustrated on synthetic dat…

2019-01-03abs ↗pdf ↗

Gradient descent dynamics in quadratic regression models are analyzed, revealing five phases: monotonic, catapult, periodic, chaotic, and divergent.

problem Analyzing the dynamics of gradient descent in quadratic regression models.
method Fine-grained bifurcation analysis of gradient descent dynamics using a cubic map parameterized by the step-size.
result Gradient descent dynamics in quadratic regression models exhibit five distinct phases: monotonic, catapult, periodic, chaotic, and divergent.

This paper extends neural collapse to class-imbalanced datasets using an unconstrained ReLU feature model.

problem Understanding neural collapse in class-imbalanced datasets with cross-entropy loss.
method Generalized neural collapse to class-imbalanced settings using an unconstrained ReLU feature model.
result Class-means converge to orthogonal vectors with different lengths, and classifier weights align to these vectors.

A time schedule simplifies learning in flow-based models for high-dimensional data.

problem Disappearance of relative probability phase in high-dimensional Gaussian mixture sampling.
method Introduces a time dilation schedule to characterize phases of learning.
result Autoencoder learns to simplify by focusing on relevant parameters for each phase.

Resource allocation improved using machine learning from terminal positions.

problem Optimizing resource allocation in next-gen wireless systems with fast-changing channel conditions.
method Supervised machine learning using position information of mobile terminals.
result Coordinates-based resource allocation performs similarly to traditional CSI-based methods.

We propose the Insertion-Deletion Transformer, a novel transformer-based neural architecture and training method for sequence generation. The model consists of two phases that are executed iteratively, 1) an insertion phase and 2) a deletion phase. The insertion phase parameterizes a distribution of insertions on the c…

2020-01-15abs ↗pdf ↗

Majority of the modern meta-learning methods for few-shot classification tasks operate in two phases: a meta-training phase where the meta-learner learns a generic representation by solving multiple few-shot tasks sampled from a large dataset and a testing phase, where the meta-learner leverages its learnt internal rep…

2020-02-11abs ↗pdf ↗

To improve the efficient frontier of the classical mean-variance model in continuous time, we propose a varying terminal time mean-variance model with a constraint on the mean value of the portfolio asset, which moves with the varying terminal time. Using the embedding technique from stochastic optimal control in conti…

2019-09-28abs ↗pdf ↗

Study shows reverberant phase is not essential for weakly-supervised dereverberation.

problem Evaluating the role of reverberant phase in weakly-supervised dereverberation.
method Statistical Wave Field Theory and recent weak supervision framework.
result Wet phase carries limited useful information and is not essential for weakly supervised dereverberation.

Reward collapse occurs when ranking-based reward models yield uniform rewards for different prompts.

problem Reward collapse in aligning large language models with human preferences.
method Introduced a prompt-aware optimization scheme to derive closed-form expressions for reward distributions.
result Our prompt-aware utility functions significantly alleviate reward collapse during training.

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.

Improved simulation of phase transitions using hierarchical autoregressive networks.

problem Simulating phase transitions in complex systems.
method Hierarchical Autoregressive Neural (HAN) network sampling algorithm.
result Significant improvement in statistical uncertainty compared to the Wolff cluster algorithm.

Bayesian theory explains abrupt emergence of copy subcircuit in attention.

problem Understanding the abrupt emergence of the copy subcircuit in attention during training.
method Deriving a closed-form posterior over the attention matrix and reducing it to a low-dimensional order parameter space.
result Derive a phase transition in the amount of training data.

This work investigates how neural collapse improves transfer learning for large-scale models.

problem Improving transfer learning for large-scale models with limited labeled data.
method Investigates neural collapse and develops a fine-tuning method using skip-connections.
result Feature collapse on downstream data correlates with higher transfer accuracy.

Large GD stepsizes improve margins and speed up training for non-homogeneous networks.

problem Training efficiency and margin improvement in non-homogeneous two-layer networks.
method Investigation of two distinct phases in GD training, showing margin growth and empirical risk decrease.
result Large GD stepsizes lead to faster convergence and improved margins in non-homogeneous networks.

Study of two-layer ReLU neural network phase diagram at infinite-width limit.

problem Characterize the dynamical regimes of two-layer ReLU neural networks.
method Combining experimental and theoretical approaches, including phase diagram analogy.
result Identification of three regimes: linear, critical, and condensed.

It is typical for a machine learning system to have numerous hyperparameters that affect its learning rate and prediction quality. Finding a good combination of the hyperparameters is, however, a challenging job. This is mainly because evaluation of each combination is extremely expensive computationally; indeed, train…

2019-07-19abs ↗pdf ↗

DP-SGD can update fewer coordinates while maintaining privacy.

problem How to update fewer coordinates in DP-SGD without losing optimization signal.
method TP-TopK (Two-Phase TopK DP-SGD), a two-phase method for coordinate-sparse private training.
result Private training can update fewer coordinates without losing optimization signal, scaling noise with active dimension \(k\) instead of full dimension \(d\).

We find optimal learning rate schedules for a random feature model.

problem Choosing optimal learning rates for deep learning models.
method We analyze a powerlaw random feature model trained with SGD, considering optimal schedules as numerical and analytical problems.
result We discover two regimes: easy and hard phases, with different optimal learning rate schedules.

The training phases of Deep neural network~(DNN) consumes enormous processing time and energy. Compression techniques utilizing the sparsity of DNNs can effectively accelerate the inference phase of DNNs. However, it can be hardly used in the training phase because the training phase involves dense matrix-multiplicatio…

2018-05-23abs ↗pdf ↗

Unsupervised learning is a discipline of machine learning which aims at discovering patterns in big data sets or classifying the data into several categories without being trained explicitly. We show that unsupervised learning techniques can be readily used to identify phases and phases transitions of many body systems…

2016-06-01abs ↗pdf ↗

Methodology that recently lead us to predict to an amazing accuracy the date (July 11, 2008) of reverse of the oil price up trend is briefly summarized and some further aspects of the related oil price dynamics elaborated. This methodology is based on the concept of discrete scale invariance whose finance-prediction-or…

2008-08-25abs ↗pdf ↗