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

21416282 · Jun 202019922001200920172026
48 results for aggressive augmentation

New theory explains contrastive learning via overlapping augmented views.

problem Lack of theoretical understanding of contrastive learning.
method Augmentation overlap perspective to improve downstream performance.
result Asymptotically closed bounds for downstream performance under weaker assumptions.

Price changes are induced by aggressive market orders in stock market. We introduce a bivariate marked Hawkes process to model aggressive market order arrivals at the microstructural level. The order arrival intensity is marked by an exogenous part and two endogenous processes reflecting the self-excitation and cross-e…

2018-11-20abs ↗pdf ↗

A method learns common bias for multiple low-variance tasks without hyper-parameter tuning.

problem Learning common bias for multiple low-variance tasks without manual tuning.
method Two variants of online learning methods (aggressive and lazy) that update bias after each datapoint or at the end of each task.
result Across-tasks regret bound derived for the method, showing faster rates for aggressive variant and standard rates for lazy variant.

Stabilizes online learning by using weighted reservoir sampling.

problem Real-world deployment sensitivity to outliers causes low accuracy in final solutions.
method Weighted reservoir sampling to stabilize ensemble model without additional data passes.
result Risk of ensemble classifier is bounded with respect to the underlying online learning method's regret.

Addressing the ongoing examination of high-frequency trading practices in financial markets, we report the results of an extensive empirical study estimating the maximum possible profitability of the most aggressive such practices, and arrive at figures that are surprisingly modest. By "aggressive" we mean any trading …

2010-07-15abs ↗pdf ↗

We provide a new online learning algorithm which utilizes online passive-aggressive learning (PA) and total-error-rate minimization (TER) for binary classification. The PA learning establishes not only large margin training but also the capacity to handle non-separable data. The TER learning on the other hand minimizes…

2020-02-05abs ↗pdf ↗

We propose a general framework to describe the impact of different events in the order book, that generalizes previous work on the impact of market orders. Two different modeling routes can be considered, which are equivalent when only market orders are taken into account. One model posits that each event type has a te…

2011-07-18abs ↗pdf ↗

A TTA framework improves forecasting accuracy in non-stationary time series.

problem Improving forecasting accuracy in non-stationary time series.
method Normalization-based test-time adaptation for causal timeseries forecasting and direction classification.
result Normalization-based TTA improves forecasting error in synthetic gradual drift and can even hurt in aggressive norm-only adaptation in financial markets.

CSER improves SGD efficiency by resetting errors and partial synchronization.

problem Limited scalability of Distributed Stochastic Gradient Descent (SGD) due to communication bottlenecks.
method Introduces 'error reset' technique and partial synchronization for gradients and models.
result Proves convergence for smooth non-convex problems and accelerates distributed training significantly.

In this paper, we focus on quantifying model stability as a function of random seed by investigating the effects of the induced randomness on model performance and the robustness of the model in general. We specifically perform a controlled study on the effect of random seeds on the behaviour of attention, gradient-bas…

2019-09-23abs ↗pdf ↗

Urban traffic systems worldwide are suffering from severe traffic safety problems. Traffic safety is affected by many complex factors, and heavily related to all drivers' behaviors involved in traffic system. Drivers with aggressive driving behaviors increase the risk of traffic accidents. In order to manage the safety…

2018-11-28abs ↗pdf ↗

The kind of realized mission inflows the sensitivity to risk. Among other factors, the risk results from decision about liquid assets investment level and liquid assets financing. The higher the risk exposure, the higher the level of liquid assets. If the specific risk exposure is smaller, the more aggressive could be …

2013-01-16abs ↗pdf ↗

Investors' strategies in a market influenced by price impact are analyzed, showing aggressive behavior when impact exceeds a critical point.

problem Strategic interaction and Nash equilibria of investors in a financial market with price impact.
method Analysis of Nash equilibria for relative investors with CRRA and CARA utility functions in a Brownian motion-driven market, considering both linear and non-linear price impacts.
result Investors' aggressive behavior is observed when price impact exceeds a critical parameter.

Detecting aggressive cancer tumors using ctDNA dynamics from few blood samples.

problem Early multi-cancer detection using circulating tumor DNA (ctDNA) levels.
method Combines continuous time Markov modelling and Signature theory for efficient testing procedures.
result Correctly addresses the challenge of data scarcity in cancer monitoring.

New method preserves spectral clustering performance under aggressive sparsification and quantization.

problem Maintaining spectral clustering performance with sparse and quantized data.
method Random matrix theory applied to eigenspectrum changes under sparsification and quantization.
result Spectral clustering performance is preserved even with aggressive sparsification and quantization.

The study analyzes how large language models form and express investor risk profiles.

problem Understanding how large language models (LLMs) form and express investor risk profiles.
method Examined three LLMs (GPT, Gemini, and Llama) and assessed their responses to a standardized risk questionnaire under varying prompts.
result LLMs generally form long-term investment profiles, but they exhibit different risk tolerance levels.

We consider the problem of demixing a sequence of source signals from the sum of noisy bilinear measurements. It is a generalized mathematical model for blind demixing with blind deconvolution, which is prevalent across the areas of dictionary learning, image processing, and communications. However, state-of- the-art c…

2018-09-18abs ↗pdf ↗

We present a class of macroscopic models of the Limit Order Book to simulate the aggregate behaviour of market makers in response to trading flows. The resulting models are solved numerically and asymptotically, and a class of similarity solutions linked to order book formation and recovery is explored. The main result…

2019-10-21abs ↗pdf ↗

Study examines how data augmentation impacts optimization in linear regression.

problem Understanding how data augmentation schedules affect optimization in linear regression.
method Analyzed the effect of augmentation on optimization in linear regression with MSE loss, using classical convex optimization and recent work on implicit bias.
result Proved that under certain joint schedules for learning rate and augmentation scheme, augmented gradient descent converges and characterized the resulting minimum.

Data augmentation doesn't improve robustness, contrary to belief.

problem The effectiveness of data augmentation in improving model robustness is questioned.
method Taking a Domain Generalization viewpoint, the study examines the robustness of augmented representations.
result Augmented representations are not robust to distortions used during training.

This paper improves auto-augment efficiency by sharing augmentation weights.

problem Efficient evaluation of augmentation policies for model training.
method Augmentation-Wise Weight Sharing (AWS) to create a fast yet accurate proxy task.
result Augmentation policies found achieve superior accuracies compared to existing methods.

RSO uses random weight perturbations to train deep networks without gradients.

problem Training deep neural networks efficiently and without gradient information.
method RSO is a gradient-free Markov Chain Monte Carlo approach that updates weights based on mini-batch loss reduction.
result RSO achieves high accuracy (99.1% on MNIST) with significantly fewer updates than traditional methods.

A study on optimizing data augmentation weights for improved test-time predictions.

problem Improving robustness of predictions during testing with data augmentation methods.
method A weighted Test-Time Augmentation (TTA) approach based on variational Bayesian framework to optimize weights.
result Optimizing weights suppresses unwanted data augmentations and improves prediction performance.

Study fully augmented links in thickened torus, generalizing S3S^3 results.

problem Classify and describe geometric properties of fully augmented links in thickened torus.
method Geometric analysis and decomposition of link complements into ideal right-angled torihedra.
result Proves Volume Density Conjecture for fully augmented links in thickened torus.

A model of open economics composed of producers and speculators is investigated by numerical simulations. The capital flows from the environment to the producers and from them to the speculators. The price fluctuations are suppressed by the speculators. When the aggressivity of the speculators grows, there is a transit…

1999-06-16abs ↗pdf ↗

SapAugment learns adaptive augmentation policies for better model training.

problem Fixed data augmentation methods often apply the same augmentation to all samples, ignoring sample difficulty.
method SapAugment adapts augmentation parameters based on training loss, learning a sample-adaptive policy.
result SapAugment achieves up to 21% relative reduction in word error rate on LibriSpeech dataset.

Automatically learns optimal data augmentation for image classification.

problem Finding optimal data augmentation hyperparameters is computationally demanding and requires domain knowledge.
method Proposes an online bilevel optimization framework to learn data augmentation parameters directly.
result Jointly trained method achieves comparable or better classification accuracy than hand-crafted data augmentation without an external validation loop.

Modern deep learning models are often trained in parallel over a collection of distributed machines to reduce training time. In such settings, communication of model updates among machines becomes a significant performance bottleneck and various lossy update compression techniques have been proposed to alleviate this p…

2019-05-27abs ↗pdf ↗