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

4183124165 · May 202619922001200920172026
48 results for Reading scores

Study prenatal PM2.5 exposure and 4th grade reading scores, identifying critical windows of susceptibility.

problem Understanding the impact of prenatal PM2.5 exposure on educational outcomes.
method Developed a locally adaptive Bayesian regression model with B-spline basis expansion and dynamic shrinkage priors.
result Prenatal PM2.5 exposure during early and late pregnancy is most adverse for 4th grade reading scores.

New method detects RNA modifications without prior training, revealing novel sites.

problem Detecting RNA modifications with high accuracy and sensitivity.
method Anomaly detection using nanopore raw ionic current signals and nearest neighbor comparison.
result Detects diverse RNA modifications without prior training, including a novel 2'-O-methylated site in DENV.

Recurrent neural networks (RNNs) can model natural language by sequentially 'reading' input tokens and outputting a distributed representation of each token. Due to the sequential nature of RNNs, inference time is linearly dependent on the input length, and all inputs are read regardless of their importance. Efforts to…

2019-03-20abs ↗pdf ↗

In this paper, we propose a semi-supervised deep learning method for detecting the specific types of reads that impede the de novo genome assembly process. Instead of dealing directly with sequenced reads, we analyze their coverage graphs converted to 1D-signals. We noticed that specific signal patterns occur in each r…

2019-04-23abs ↗pdf ↗

Dead-Direction Signatures (DDS) provide a cheap, closed-form spectral reading of a network's singular complexity.

problem Estimating the complexity of deep networks through their loss singularities.
method DDS replaces the SGLD posterior chain with spectral linear algebra.
result DDS observables rank-track the network's singular complexity at the framework-predicted sign.

ForesightFlow detects informed trading on prediction markets using an information leakage score.

problem Detecting informed trading on decentralized prediction markets.
method Developed an Information Leakage Score (ILS) framework to quantify the fraction of terminal information move priced in before public news events.
result The score connects label generation to proper-scoring-rule literature and reveals systematic biases in insider trading documentation.

BoXHED boosts hazard estimation for dynamic health risk scores.

problem Analyzing time-varying health vitals for disease onset prediction.
method Gradient boosting for nonparametric hazard function estimation with time-dependent covariates.
result Novel interaction effects among risk factors identified in cardiovascular disease onset data.

Case vs control comparisons have been the classical approach to the study of neurological diseases. However, most patients will not fall cleanly into either group. Instead, clinicians will typically find patients that cannot be classified as having clearly progressed into the disease state. For those subjects, very lit…

2012-07-19abs ↗pdf ↗

Many Machine Reading and Natural Language Understanding tasks require reading supporting text in order to answer questions. For example, in Question Answering, the supporting text can be newswire or Wikipedia articles; in Natural Language Inference, premises can be seen as the supporting text and hypotheses as question…

2018-06-20abs ↗pdf ↗

Shannon's mathematical theory of communication defines fundamental limits on how much information can be transmitted between the different components of any man-made or biological system. This paper is an informal but rigorous introduction to the main ideas implicit in Shannon's theory. An annotated reading list is pro…

2018-02-16abs ↗pdf ↗

We present a graphical criterion for reading dependencies from the minimal directed independence map G of a graphoid p when G is a polytree and p satisfies composition and weak transitivity. We prove that the criterion is sound and complete. We argue that assuming composition and weak transitivity is not too restrictiv…

2012-06-20abs ↗pdf ↗

One out of four children in India are leaving grade eight without basic reading skills. Measuring the reading levels in a vast country like India poses significant hurdles. Recent advances in machine learning opens up the possibility of automating this task. However, the datasets of children's speech are not only rare …

2019-11-27abs ↗pdf ↗

Aggregates diverse zero-shot LLM outputs for better corporate disclosure classification.

problem Combining varied zero-shot LLM predictions for improved stock return prediction.
method Multi-prompt framework with three fixed zero-shot LLM classifiers, logistic meta-classifier aggregation.
result Aggregated model outperforms single classifiers and baseline models, increasing balanced accuracy from 0.566 to 0.606.

Introduces recency bias to improve time-series forecasting.

problem Lack of recency bias in standard Transformer attention for time-series data.
method Reweights attention scores with a smooth heavy-tailed decay to emphasize nearby observations.
result Recency-biased attention consistently improves sequential modeling and achieves competitive performance on time-series forecasting benchmarks.

Neural network optimizes learning sequence for reading words.

problem Children struggle with learning to read words due to inconsistent spelling-sound correspondences.
method Used a neural network to structure learning trials to optimize generalization accuracy.
result Significant improvement in generalization accuracy compared to random or frequency-based sequences.

Measures mode separation in high-dimensional densities via a reversible diffusion process.

problem Quantifying how sharply a distribution fragments into barrier-separated clusters in high dimensions.
method A unique reversible diffusion process with f as stationary distribution, extracting SSA and DA from its autocovariance matrix.
result Empirical autocovariance spectrum and readouts (SSA, DA) quantify mode separation using only samples and pretrained score-based models.

A rising topic in computational journalism is how to enhance the diversity in news served to subscribers to foster exploration behavior in news reading. Despite the success of preference learning in personalized news recommendation, their over-exploitation causes filter bubble that isolates readers from opposing viewpo…

2017-06-30abs ↗pdf ↗

This work tackles missing annotations in large sensor datasets.

problem Missing annotations in large sensor datasets negatively affect supervised learning system performance.
method Proposes and evaluates three paradigms to handle gaps: dropping, single label, and unique label, along with a hybrid combination.
result Evaluation of proposed paradigms and hybrid combination shows significant performance improvement.

Algorithm reduces audit costs by identifying best service configurations from biased textual evidence.

problem Designing service systems from textual evidence requires accurate selection despite biased automated scoring.
method Developed PP-LUCB algorithm combining LLM scores and selective audits to minimize costs.
result Correctly identified the best model in 40/40 trials with 90% cost reduction.

Typical large-scale recommender systems use deep learning models that are stored on a large amount of DRAM. These models often rely on embeddings, which consume most of the required memory. We present Bandana, a storage system that reduces the DRAM footprint of embeddings, by using Non-volatile Memory (NVM) as the prim…

2018-11-14abs ↗pdf ↗

The covariance graph (aka bi-directed graph) of a probability distribution pp is the undirected graph GG where two nodes are adjacent iff their corresponding random variables are marginally dependent in pp. In this paper, we present a graphical criterion for reading dependencies from GG, under the assumption that $…

2010-10-21abs ↗pdf ↗

A discrete diffusion model learns denoising, scoring, and bridging in different coordinates.

problem Understanding what a discrete diffusion model learns in different coordinate systems.
method Rigorous derivation of continuous-time Markov chain ELBO, Oracle Distance theorem, and exact coordinates for optimizer.
result The negative ELBO is exactly equal to the data entropy plus the path KL from the oracle reverse process to the learned one.

Memory networks are neural networks with an explicit memory component that can be both read and written to by the network. The memory is often addressed in a soft way using a softmax function, making end-to-end training with backpropagation possible. However, this is not computationally scalable for applications which …

2016-05-24abs ↗pdf ↗

Audit shows risk claims from distributional reinforcement learning agents are often false.

problem Evaluating the risk claims made by distributional reinforcement learning agents.
method Combines a decision-relevant screening metric, ground truth from Monte Carlo, and statistical methods to audit risk claims.
result 40-95% of the strongest risk claims are refuted, indicating the learned risk reflects a training artifact rather than environment stochasticity.

The study finds that firm membership in flagship indices and TCFD endorsement are strong predictors of a wider Disclosure-Performance Gap.

problem The Aggregate Confusion hypothesis and the measurement of greenwashing in environmental disclosures.
method The study uses a Disclosure-Performance Gap (DPG) model to measure the divergence between voluntary environmental disclosures and realised emissions performance for 200 large European firms. The model selection process involved multiple stages and robust standard errors.
result Firm membership in flagship indices and TCFD endorsement are strong predictors of a wider gap, while renewable energy use and environmental capital expenditure significantly narrow the gap.

New tool uses computer vision to assess FOMC press conference complexity and its impact on equity returns.

problem Understanding the impact of FOMC press conferences on financial markets.
method Developed a measure of discussion complexity using video images and deep learning algorithms.
result Complex discussions during press conferences are associated with higher equity returns and lower volatility.

Proposes a framework to adjust quotes for informational risk in markets with informed traders and price-revealing quotes.

problem Informational risk in markets with informed traders and price-revealing quotes.
method Proposes a tractable framework to adjust quotes considering adverse selection and price reading.
result Market makers can adjust their quotes to better manage informational risk.

Standard probabilistic linear discriminant analysis (PLDA) for speaker recognition assumes that the sample's features (usually, i-vectors) are given by a sum of three terms: a term that depends on the speaker identity, a term that models the within-speaker variability and is assumed independent across samples, and a fi…

2017-04-07abs ↗pdf ↗