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.

169,051 papers · 148 categories

Trend · papers per month

3570104139 · Jun 202019922001200920182026
48 results for incremental impact

Study examines how COVID-19 affected stock and crypto market efficiency.

problem Impact of COVID-19 on market efficiency of different asset classes.
method Analysis of price returns, absolute returns, and volatility increments in stock and cryptocurrency markets.
result Market efficiency varied by asset class and market, with some time series showing gradual decline over time.

PEAKS selects key training examples incrementally based on prediction error and kernel similarity.

problem Dynamic data selection in deep learning models.
method Prediction Error Anchored by Kernel Similarity (PEAKS) for incremental data selection.
result PEAKS outperforms existing selection strategies and yields better performance returns as training data size grows.

We develop a theory for the market impact of large trading orders, which we call metaorders because they are typically split into small pieces and executed incrementally. Market impact is empirically observed to be a concave function of metaorder size, i.e., the impact per share of large metaorders is smaller than that…

2011-02-26abs ↗pdf ↗

Study analyzes price response and spread impact in foreign exchange markets.

problem Understanding deviations from Markovian behavior in foreign exchange markets.
method Detailed large-scale data analysis of price response functions for different years and time scales, using pip bid-ask spread definition.
result Large pip spreads significantly impact price response in foreign exchange markets.

Study finds exposure bias distortion is limited and not incremental in open-ended text generation.

problem Exposure bias in auto-regressive language models causing incremental distortion.
method Proposed metrics to quantify exposure bias impact, used ground-truth prefixes instead of model-generated prefixes.
result Exposure bias distortion is limited and not incremental during generation.

A system for attributing ad effects using a neural network and Shapley values.

problem Attributing ad effects to individual ads in a complex, sequential environment.
method A two-step approach: response modeling with RNN and credit allocation with Shapley values.
result The system accurately allocates incremental ad effects to individual ads, handling sequence dependence.

Study examines pricing strategies in competitive supply chains with discrete prices.

problem Inaccurate assumptions in traditional SC models for pricing decisions.
method Examines a SC model with one supplier and two manufacturers, considering customer demand segmentation and discrete price setting.
result Nash equilibria among manufacturers are not unique, and low denomination factors can lead to instability.

We introduce incremental variational inference and apply it to latent Dirichlet allocation (LDA). Incremental variational inference is inspired by incremental EM and provides an alternative to stochastic variational inference. Incremental LDA can process massive document collections, does not require to set a learning …

2015-07-17abs ↗pdf ↗

Study compares GFMM neural networks for pattern classification.

problem Pattern classification problems.
method Two algorithms (incremental and agglomerative learning) to train GFMM neural networks.
result GFMM neural networks show strong and weak points on benchmark datasets.

The paper extends cluster validity indices for incremental analysis.

problem Providing incremental alternatives for cluster validation.
method Extending iCVI family to include 6 incremental indices and examining their behavior under under- and over-partitioning.
result Over-partitioning is more challenging to detect than under-partitioning.

New approach AR1 improves performance in class-incremental learning.

problem Training deep models sequentially on a single incremental task without forgetting.
method Combining architectural and regularization strategies, AR1 is specifically designed for incremental task scenarios.
result AR1 outperformed existing regularization strategies on CORe50 and iCIFAR-100.

Time and Sales of corn futures traded electronically on the CME Group Globex are studied. Theories of continuous prices turn upside down reality of intra-day trading. Prices and their increments are discrete and obey lattice probability distributions. A function for systematic evolution of futures trading volume is pro…

2017-04-03abs ↗pdf ↗

Depth helps neural networks learn simpler solutions incrementally.

problem Understanding why deep neural networks generalize well despite complex architectures.
method Formal definition of incremental learning dynamics, theoretical analysis of depth and initialization effects, experiments with various models.
result Incremental learning dynamics can arise in deeper models, but not in shallow ones, under specific conditions.

Paper tackles few-shot class-incremental learning with a neural gas network.

problem Incrementally learn new classes from very few labelled samples without forgetting old classes.
method Proposes TOPIC framework using a neural gas network to preserve class topology and adapt to new samples.
result Significantly outperforms other methods on CIFAR100, miniImageNet, and CUB200 datasets.

In this article we revisit the classic problem of tatonnement in price formation from a microstructure point of view, reviewing a recent body of theoretical and empirical work explaining how fluctuations in supply and demand are slowly incorporated into prices. Because revealed market liquidity is extremely low, large …

2008-09-04abs ↗pdf ↗

Narrative disclosures in 10-K filings improve bankruptcy prediction beyond accounting ratios.

problem Traditional bankruptcy prediction models rely on accounting ratios, which may not capture early warning signals.
method Developed a PB Stress Score based on distress-specific language in 10-K narratives, evaluated against accounting and dictionary benchmarks.
result Adding the PB Stress Score increases AUC from 0.8323 to 0.9019 and improves top-decile bankruptcy capture from 44.12% to 64.71%.

A new model learns preferences incrementally without personal data.

problem Incremental session-based recommendation without personal data.
method Memory Augmented Neural model (MAN) that combines a neural recommender with a nonparametric memory.
result MAN consistently outperforms existing methods in incremental session-based recommendation.

Incremental versions of batch algorithms are often desired, for increased time efficiency in the streaming data setting, or increased memory efficiency in general. In this paper we present a novel algorithm for incremental kernel PCA, based on rank one updates to the eigendecomposition of the kernel matrix, which is mo…

2018-01-31abs ↗pdf ↗

Paper proposes CNE-net to tackle incremental learning in (T)ACSA tasks.

problem Catastrophic forgetting in multi-task incremental learning for (T)ACSA.
method Category Name Embedding network (CNE-net) with shared encoder and decoder.
result State-of-the-art performance on (T)ACSA benchmark datasets.

This paper introduces Deep Incremental Boosting, a new technique derived from AdaBoost, specifically adapted to work with Deep Learning methods, that reduces the required training time and improves generalisation. We draw inspiration from Transfer of Learning approaches to reduce the start-up time to training each incr…

2017-08-11abs ↗pdf ↗

GraphSAIL updates GNN-based recommender models incrementally to reduce computation time and improve frequent updates.

problem Incremental updates in GNN-based recommender systems are computationally expensive and prone to forgetting.
method GraphSAIL uses a graph structure preservation strategy to update GNN models incrementally, preserving long-term preferences and properties.
result GraphSAIL reduces computation time and improves frequent updates compared to other incremental learning techniques.

This paper presents a novel approach for incremental semiparametric inverse dynamics learning. In particular, we consider the mixture of two approaches: Parametric modeling based on rigid body dynamics equations and nonparametric modeling based on incremental kernel methods, with no prior information on the mechanical …

2016-01-18abs ↗pdf ↗

Data is continuously generated by modern data sources, and a recent challenge in machine learning has been to develop techniques that perform well in an incremental (streaming) setting. In this paper, we investigate the problem of private machine learning, where as common in practice, the data is not given at once, but…

2017-01-04abs ↗pdf ↗

We analyze the question whether sliding window time averages applied to stationary increment processes converge to a limit in probability. The question centers on averages, correlations, and densities constructed via time averages of the increment x(t,T)=x(t+T)-x(t)and the assumption is that the increment is distribute…

2008-04-06abs ↗pdf ↗

Paper aims to improve AI's ability to learn new tasks incrementally.

problem Catastrophic Forgetting in AI systems learning multiple tasks simultaneously.
method Analyzed iCaRL method, identified knowledge distillation as key, proposed dynamic threshold moving algorithm.
result Demonstrated effectiveness of dynamic threshold moving algorithm on CIFAR100 and MNIST datasets.

New algorithm improves on EM for streaming data, outperforming existing methods.

problem Processing high-volume, streaming data efficiently.
method Incremental stochastic Majorization-Minimization (MM) algorithm.
result The algorithm converges to a stationary point with vanishing gradient.

Uplift modeling is aimed at estimating the incremental impact of an action on an individual's behavior, which is useful in various application domains such as targeted marketing (advertisement campaigns) and personalized medicine (medical treatments). Conventional methods of uplift modeling require every instance to be…

2018-03-14abs ↗pdf ↗

Proposes MEDIC to improve incremental learning by preventing forgetting and intransigence.

problem Challenges of forgetting old knowledge and intransigence on new knowledge in incremental learning.
method Maximum Entropy Regularizer (MER) and DropOut Sampling (DOS) to penalize uncertain knowledge and reduce class imbalance.
result Proposed method 'MEDIC' outperforms state-of-the-art algorithms in accuracy, forgetting, and intransigence.

Stochastic Gradient Trees learn decision trees incrementally.

problem Learning decision trees using stochastic gradient information.
method Incremental learning setting, soft splits not used, new tree not constructed per update.
result Performs similarly to standard incremental classification trees, outperforms state of the art incremental regression trees, comparable to batch multi-instance learning methods.

Tensor decompositions are invaluable tools in analyzing multimodal datasets. In many real-world scenarios, such datasets are far from being static, to the contrary they tend to grow over time. For instance, in an online social network setting, as we observe new interactions over time, our dataset gets updated in its "t…

2017-09-03abs ↗pdf ↗

A new generative classification strategy outperforms existing methods in class-incremental learning.

problem Incrementally training deep neural networks to recognize new classes is challenging.
method Proposes learning the joint distribution p(x,y) and performing classification using Bayes' rule, implemented with variational autoencoders and importance sampling.
result Performs very well on continual learning benchmarks, outperforming existing baselines.

The statistical properties of the increments x(t+T) - x(t) of a financial time series depend on the time resolution T on which the increments are considered. A non-parametric approach is used to study the scale dependence of the empirical distribution of the price increments x(t+T) - x(t) of S&P Index futures, for time…

1997-05-08abs ↗pdf ↗

For classification of the high frequency trading quantities, waiting times, price increments within and between sessions are referred to as the a-, b-, and c-increments. Statistics of the a-b-c-increments are computed for the Time & Sales records posted by the Chicago Mercantile Exchange Group for the futures traded on…

2013-12-06abs ↗pdf ↗