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,042 papers · 148 categories

Trend · papers per month

8.3%16.7%25.0%33.3% · Jul 199219922001200920172026
48 results for output length

Paper tackles model failures producing outputs of undesirable length.

problem Model failures producing outputs of undesirable length.
method Develops a differentiable proxy objective and a verification approach.
result Can produce outputs 50 times longer than input and prove output length below a certain size.

We present the first treatment of the arc length of the Gaussian Process (GP) with more than a single output dimension. GPs are commonly used for tasks such as trajectory modelling, where path length is a crucial quantity of interest. Previously, only paths in one dimension have been considered, with no theoretical con…

2017-03-23abs ↗pdf ↗

New clustering method uses Wasserstein distance to analyze simulation outputs.

problem Analyzing stochastic simulation outputs to uncover relationships and patterns.
method Agglomerative clustering using regularized Wasserstein distance.
result Identifies staffing plans yielding similar performance outcomes.

Model learns brevity by exposing to easy problems, improving efficiency without explicit length penalties.

problem Excessive verbosity in step-by-step reasoning models trained with RLVR.
method Retaining and up-weighting moderately easy problems as implicit length regularizers.
result Model generates solutions that are, on average, nearly twice as short without explicit length penalties.

Fine-tuning improves information conveyance in language models by reorganizing uncertainty into more informative sequences.

problem Uncertainty reduction in large language models through fine-tuning is not fully understood, especially regarding output length.
method Proposed Canopy Entropy (CE\mathrm{CE}^\star) to measure uncertainty in both output length and sequence, capturing total Shannon entropy.
result Fine-tuned models exhibit stronger positive correlation between entropy rate and semantic diversity, indicating more informative and semantically meaningful generations.

Recurrent Neural Networks (RNNs) are among the most popular models in sequential data analysis. Yet, in the foundational PAC learning language, what concept class can it learn? Moreover, how can the same recurrent unit simultaneously learn functions from different input tokens to different output tokens, without affect…

2019-02-04abs ↗pdf ↗

We introduce a new neural architecture to learn the conditional probability of an output sequence with elements that are discrete tokens corresponding to positions in an input sequence. Such problems cannot be trivially addressed by existent approaches such as sequence-to-sequence and Neural Turing Machines, because th…

2015-06-09abs ↗pdf ↗

We present the Latent Sequence Decompositions (LSD) framework. LSD decomposes sequences with variable lengthed output units as a function of both the input sequence and the output sequence. We present a training algorithm which samples valid extensions and an approximate decoding algorithm. We experiment with the Wall …

2016-10-10abs ↗pdf ↗

New algorithm reduces costs and latency for large language model inference.

problem Optimizing inference costs and latency for large language models with GPU constraints.
method Formulated as an online scheduling problem with endogenous memory growth, introduced fluid model and WAIT algorithms.
result Reduced costs and latency, especially in near-overloaded and overloaded regimes.

Transformers can interpolate finite input sequences exactly.

problem Interpolating finite input sequences of arbitrary lengths.
method Constructing a transformer with alternating feed-forward and self-attention layers, and low-rank parameter matrices.
result Exact interpolation of datasets of finite input sequences in R^d with corresponding output sequences of smaller or equal length.

Many machine learning tasks can be expressed as the transformation---or \emph{transduction}---of input sequences into output sequences: speech recognition, machine translation, protein secondary structure prediction and text-to-speech to name but a few. One of the key challenges in sequence transduction is learning to …

2012-11-14abs ↗pdf ↗

We introduce a new regression framework, Gaussian process regression networks (GPRN), which combines the structural properties of Bayesian neural networks with the non-parametric flexibility of Gaussian processes. This model accommodates input dependent signal and noise correlations between multiple response variables,…

2011-10-19abs ↗pdf ↗

Current end-to-end deep Reinforcement Learning (RL) approaches require jointly learning perception, decision-making and low-level control from very sparse reward signals and high-dimensional inputs, with little capability of incorporating prior knowledge. This results in prohibitively long training times for use on rea…

2018-09-20abs ↗pdf ↗

We introduce a variant of Farber's topological complexity, defined for smooth compact orientable Riemannian manifolds, which takes into account only motion planners with the lowest possible "average length" of the output paths. We prove that it never differs from topological complexity by more than 11, thus showing th…

2016-07-04abs ↗pdf ↗

Selective prediction-set models improve predictive reliability and uncertainty quantification.

problem Inaccurate and unreliable predictions from black-box models, especially for unfamiliar data.
method Training selective prediction-set models using uncertainty-aware loss minimization, and calculating well-calibrated prediction sets.
result Selective prediction-set models outperform existing approaches in predicting in-hospital mortality and length-of-stay for ICU patients.

New constructions show manifold volumes are dense in non-negative reals.

problem Understanding the spectrum of simplicial volumes in manifolds.
method Group homology constructions and manifold constructions using cross-products and Thom realisation.
result The set of simplicial volumes of orientable closed connected manifolds is dense in R0\mathbb{R}_{\geq 0} for dimensions > 3, and every non-negative rational number is a simplicial volume for dimension 4.

We propose a new approach to the problem of neural network expressivity, which seeks to characterize how structural properties of a neural network family affect the functions it is able to compute. Our approach is based on an interrelated set of measures of expressivity, unified by the novel notion of trajectory length…

2016-06-16abs ↗pdf ↗

We study the centralizer of a braid from the point of view of Garside theory, showing that generically a minimal set of generators can be computed very efficiently, as the ultra summit set of a generic braid has a very particular structure. We present an algorithm to compute the centralizer of a braid whose generic-cas…

2018-02-13abs ↗pdf ↗

New techniques improve channel prediction in noisy wireless systems.

problem Predicting channels in wireless communication systems from noisy observations.
method Adapted sequence-to-sequence models and transformers with reverse positional encoding and reversed encoder outputs.
result Improved robustness and relationship capture in channel prediction models.

We study the use of a time series encoder to learn representations that are useful on data set types with which it has not been trained on. The encoder is formed of a convolutional neural network whose temporal output is summarized by a convolutional attention mechanism. This way, we obtain a compact, fixed-length repr…

2018-05-10abs ↗pdf ↗

Maxout networks study gradients and propose initialization strategies.

problem Complexity in input-output Jacobian distribution complicates stable parameter initialization.
method Obtained bounds on moments of gradients and formulated initialization strategies.
result Parameter initialization strategies improve training of deep maxout networks.

Study builds a Japanese financial-specific LLM through continual pre-training.

problem Lack of domain-specific Japanese financial LLMs.
method Continual pre-training on Japanese financial-focused datasets using a base Japanese LLM.
result Tuned model outperforms original model on Japanese financial benchmarks.

Learning-based binary hashing has become a powerful paradigm for fast search and retrieval in massive databases. However, due to the requirement of discrete outputs for the hash functions, learning such functions is known to be very challenging. In addition, the objective functions adopted by existing hashing technique…

2017-01-11abs ↗pdf ↗

We propose learning flexible but interpretable functions that aggregate a variable-length set of permutation-invariant feature vectors to predict a label. We use a deep lattice network model so we can architect the model structure to enhance interpretability, and add monotonicity constraints between inputs-and-outputs.…

2018-05-31abs ↗pdf ↗

Adaptive beamforming collapses in highly non-stationary environments, but the Universal Switching Beamformer resolves this by dynamically adjusting memory length.

problem Adaptive beamforming performance degrades in highly non-stationary environments.
method Integrating sequential prediction into the beamforming architecture.
result The USB achieves agility and precision in tracking highly non-stationary scenes.

Tree-based LSTM improves sequential regression with missing data.

problem Regression for variable-length sequential data with missing samples.
method Tree architecture of LSTM networks, selecting LSTM networks based on presence-pattern of previous inputs.
result Significant performance improvements on financial and real-life datasets.

We examine Deep Canonically Correlated LSTMs as a way to learn nonlinear transformations of variable length sequences and embed them into a correlated, fixed dimensional space. We use LSTMs to transform multi-view time-series data non-linearly while learning temporal relationships within the data. We then perform corre…

2018-01-16abs ↗pdf ↗

Efficient algorithms for deleting data from machine learning models without significantly affecting performance.

problem Deleting data from machine learning models while maintaining performance.
method Leveraging convex optimization and reservoir sampling, the paper introduces algorithms for handling long sequences of adversarial updates.
result First data deletion algorithms that promise steady-state error not growing with the length of the update sequence.

Paper introduces Ddim, a new measure of model complexity, for MDL-based learning and change detection.

problem Characterizing the complexity of probabilistic models for efficient learning and change detection.
method Introduces descriptive dimension (Ddim) as a measure of model complexity. Derives convergence rates and error probabilities for MDL-based learning and change detection.
result Ddim characterizes the performance of MDL-based learning and change detection.

The paper analyzes system identification with finite data.

problem Recovering system parameters and Kalman filter gain from noisy output measurements.
method Subspace identification algorithm, finite number of output samples, random matrix theory, self-normalized martingales, SVD robustness.
result Estimation errors decrease with a rate of 1/\sqrt{N}, valid even for marginally stable systems.

Bi-GAN model for imputing and predicting irregular time-series data.

problem Irregularly observed, varying length time-series data with missing entries.
method Bi-GAN model using a bidirectional recurrent network in a generative adversarial setting.
result Bi-GAN model can impute and predict missing values for time-series of varying length.

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 study on power market price forecasting by deep learning is presented. As one of the most successful deep learning frameworks, the LSTM (Long short-term memory) neural network is utilized. The hourly prices data from the New England and PJM day-ahead markets are used in this study. First, a LSTM network is formulated…

2018-09-18abs ↗pdf ↗

Latent Block-Diffusion Temporal Point Processes (LBDTPP) is a semi-autoregressive framework for generating asynchronous event sequences.

problem Generating asynchronous event sequences
method Latent Block-Diffusion Temporal Point Processes
result Outperforms state-of-the-art TPP baselines in both unconditional and conditional generation tasks