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

1223 · Sep 201919922001200920172026
48 results for chunking

Decouples critic chunk length from policy to improve policy reactivity and performance.

problem Bootstrapping bias and difficulty in extracting optimal policies from chunked critics.
method Optimizes policy against a distilled critic for partial action chunks, allowing shorter chunks for policy.
result Reliably outperforms prior methods on long-horizon offline goal-conditioned tasks.

A quantum model classifies financial sentiment by mapping text chunks to quantum circuits.

problem Classifying financial texts with high accuracy and preserving semantic information.
method Chunked diagrams are mapped to quantum circuits, with a Transformer encoder and type embeddings added for context.
result The hybrid model improves sentiment classification over a simple averaging baseline.

Chunking is a significant CL problem, accounting for half of performance drop, and current methods don't address it.

problem Chunking of data in continual learning.
method Analyzing and addressing the chunking sub-problem in continual learning.
result Current CL algorithms perform poorly on chunking, only as well as plain SGD training when there is no distribution shift.

Action chunking and data exploration improve behavior cloning in robotics.

problem Exponential errors in learning from demonstrations for continuous control tasks.
method Action chunking and exploratory data collection.
result Control-theoretic stability is key to improving imitation learning.

Ricci-Filtration enhances retrieval-augmented generation rerankers for query-answer tasks by using discrete Ricci flow on graphs.

problem Improving retrieval-augmented generation rerankers for query-answer tasks.
method Discrete Ricci flow on graphs to evaluate structural importance of chunks.
result Ricci-Filtration outperforms baseline methods in accuracy, precision, recall, and F1 scores.

This paper improves retrieval for LLMs in financial document Q&A.

problem Suboptimal text chunk retrieval by RAG causes inaccuracies in LLM responses.
method Sophisticated chunking techniques, query expansion, metadata annotations, re-ranking algorithms, and embedding fine-tuning.
result Enhanced retrieval quality improves LLM performance and reliability.

CMoS improves time series forecasting with minimal parameters.

problem Efficiently forecasting time series data with limited resources.
method CMoS directly models chunk-wise spatial correlations, using Correlation Mixing and Periodicity Injection techniques.
result CMoS outperforms state-of-the-art models with minimal parameters.

SDCOR clusters massive datasets efficiently, detecting outliers with low memory usage.

problem Local outlier detection in large-scale datasets.
method Chunk-based density clustering with incremental updates.
result SDCOR achieves lower linear time complexity and better efficiency than traditional methods.

FinFlowRL combines imitation and reinforcement learning for better financial control.

problem Traditional stochastic control methods fail in real-world finance due to changing market conditions.
method FinFlowRL uses imitation learning to pretrain an adaptive meta policy, then finetunes it with reinforcement learning.
result FinFlowRL consistently outperforms individual strategies across various market conditions.

ReWTS ensemble improves time-series forecasting by adapting to changing dynamics.

problem Complex, multi-faceted, evolving data in process industries.
method Chunk-based, recency-weighted temporal segmentation of data for multi-step forecasting.
result Significantly outperforms conventional models in mean squared forecasting error.

KATA improves associative recall by optimizing feature maps derived from nonnegative attention weights.

problem Linear attention's poor performance on associative recall tasks.
method Formulates attention recall as a spherical-packing problem and introduces Kernelized Linear Attention Activations (KATA).
result KATA features offer a favorable capacity-interference tradeoff, enabling efficient associative recall.

Reinforcement learning has attracted great attention recently, especially policy gradient algorithms, which have been demonstrated on challenging decision making and control tasks. In this paper, we propose an active multi-step TD algorithm with adaptive stepsizes to learn actor and critic. Specifically, our model cons…

2019-11-11abs ↗pdf ↗

Recent studies have shown that neural models can achieve high performance on several sequence labelling/tagging problems without the explicit use of linguistic features such as part-of-speech (POS) tags. These models are trained only using the character-level and the word embedding vectors as inputs. Others have shown …

2019-09-29abs ↗pdf ↗

Although support vector machines (SVMs) are theoretically well understood, their underlying optimization problem becomes very expensive, if, for example, hundreds of thousands of samples and a non-linear kernel are considered. Several approaches have been proposed in the past to address this serious limitation. In this…

2016-12-01abs ↗pdf ↗

A new framework uses directed information to efficiently select context chunks.

problem Efficiently selecting relevant context chunks for query understanding.
method Directed Information γγ-covering framework, formulated as a γγ-cover problem, with a greedy algorithm for context selection.
result The γγ-covering algorithm provides clear advantages in hard-decision regimes like context compression and single-slot prompt selection.

One of the limiting factors of using support vector machines (SVMs) in large scale applications are their super-linear computational requirements in terms of the number of training samples. To address this issue, several approaches that train SVMs on many small chunks of large data sets separately have been proposed in…

2015-07-23abs ↗pdf ↗

FinReflectKG - EvalBench benchmarks financial KG extraction from SEC 10-K filings.

problem Lack of universal benchmark and evaluation framework for financial KG construction.
method Agentic and holistic evaluation principles, deterministic commit-then-justify judging protocol, binary and ordinal evaluations.
result Reflection-based extraction outperforms single-pass extraction in comprehensiveness, precision, and relevance.

Conditional random fields (CRFs) have been shown to be one of the most successful approaches to sequence labeling. Various linear-chain neural CRFs (NCRFs) are developed to implement the non-linear node potentials in CRFs, but still keeping the linear-chain hidden structure. In this paper, we propose NCRF transducers, …

2018-11-04abs ↗pdf ↗

Today, the dominant paradigm for training neural networks involves minimizing task loss on a large dataset. Using world knowledge to inform a model, and yet retain the ability to perform end-to-end training remains an open question. In this paper, we present a novel framework for introducing declarative knowledge to ne…

2019-06-14abs ↗pdf ↗

Bayesian Neural Networks detect gravitational wave events with high accuracy and real-time potential.

problem Detecting and identifying the full duration of compact binary coalescence events in gravitational wave data.
method Integrating Bayesian approach into a CLDNN classifier that combines CNN and LSTM for event detection and uncertainty estimation.
result Successfully detected all seven BBH events in LIGO Livingston O2 data with high accuracy.

Sequence-to-sequence models with soft attention have been successfully applied to a wide variety of problems, but their decoding process incurs a quadratic time and space cost and is inapplicable to real-time sequence transduction. To address these issues, we propose Monotonic Chunkwise Attention (MoChA), which adaptiv…

2017-12-14abs ↗pdf ↗

FinFlowRL learns from experts to optimize financial control in changing markets.

problem Traditional finance control methods fail in real-world, non-stationary markets.
method Imitation-Reinforcement Learning framework that pretrains on expert strategies and finetunes in noise space.
result Consistently outperforms individually optimized experts across diverse market conditions.

Recent years have seen a boom in interest in machine learning systems that can provide a human-understandable rationale for their predictions or decisions. However, exactly what kinds of explanation are truly human-interpretable remains poorly understood. This work advances our understanding of what makes explanations …

2019-01-31abs ↗pdf ↗

Many modern applications deal with multi-label data, such as functional categorizations of genes, image labeling and text categorization. Classification of such data with a large number of labels and latent dependencies among them is a challenging task, and it becomes even more challenging when the data is received onl…

2018-04-04abs ↗pdf ↗

We propose a two-sample testing procedure based on learned deep neural network representations. To this end, we define two test statistics that perform an asymptotic location test on data samples mapped onto a hidden layer. The tests are consistent and asymptotically control the type-1 error rate. Their test statistics…

2019-10-14abs ↗pdf ↗

BERT, which stands for Bidirectional Encoder Representations from Transformers, is a recently introduced language representation model based upon the transfer learning paradigm. We extend its fine-tuning procedure to address one of its major limitations - applicability to inputs longer than a few hundred words, such as…

2019-10-23abs ↗pdf ↗

A key aspect of Federated Learning (FL) is the requirement of a centralized aggregator to maintain and update the global model. However, in many cases orchestrating a centralized aggregator might be infeasible due to numerous operational constraints. In this paper, we introduce BAFFLE, an aggregator free, blockchain dr…

2019-09-16abs ↗pdf ↗

The restricted Boltzmann machine (RBM) is a flexible tool for modeling complex data, however there have been significant computational difficulties in using RBMs to model high-dimensional multinomial observations. In natural language processing applications, words are naturally modeled by K-ary discrete distributions, …

2012-02-25abs ↗pdf ↗

Extends NAS to learn both intra-cell and inter-cell architectures for language modeling.

problem Limited NAS systems restrict search to recurrent or convolutional cells.
method Designs a joint learning method to perform intra-cell and inter-cell NAS simultaneously.
result Significantly outperforms a strong baseline on PTB and WikiText data.

Given a knot in 3-space, one can associate a sequence of Laurrent polynomials, whose nnth term is the nnth colored Jones polynomial. The Generalized Volume Conjecture states that the value of the nn-th colored Jones polynomial at $\exp(2 πi \a/n)$ is a sequence of complex numbers that grows exponentially, for a fixe…

2005-02-08abs ↗pdf ↗