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

Trend · papers per month

54108162216 · May 202619922001200920172026
48 results for reading levels

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 ↗

Paper tackles non-convex constrained DRO with a stochastic algorithm for large-scale applications.

problem Training robust models against data distribution shifts with non-convex loss functions.
method Developed a stochastic algorithm for non-convex constrained DRO with a complexity independent of dataset size.
result Algorithm finds ε-stationary points with computational complexity of O(ε^(-3k_*-5)) for general Cressie-Read divergence.

Metagenomics characterizes the taxonomic diversity of microbial communities by sequencing DNA directly from an environmental sample. One of the main challenges in metagenomics data analysis is the binning step, where each sequenced read is assigned to a taxonomic clade. Due to the large volume of metagenomics datasets,…

2015-05-26abs ↗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.

Study develops advanced models to forecast complex LOB data.

problem Forecasting high-frequency data in a limit order book (LOB).
method Advanced multidimensional sequence-to-sequence models with compound multivariate embedding.
result Method outperforms other multivariate forecasting methods, achieving lowest forecasting error.

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 ↗

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.

Existing machine reading comprehension (MRC) models do not scale effectively to real-world applications like web-level information retrieval and question answering (QA). We argue that this stems from the nature of MRC datasets: most of these are static environments wherein the supporting documents and all necessary inf…

2019-08-27abs ↗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 ↗

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.

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.

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 ↗

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.

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 ↗

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.

Model predicts traffic incident duration and identifies key features.

problem Predict traffic incident duration and identify critical features.
method Multi-task learning framework with sparsity optimization and ADMM algorithm.
result Model predicts incident duration and identifies key features effectively.

Personalized predictive medicine necessitates the modeling of patient illness and care processes, which inherently have long-term temporal dependencies. Healthcare observations, recorded in electronic medical records, are episodic and irregular in time. We introduce DeepCare, an end-to-end deep dynamic neural network t…

2016-02-01abs ↗pdf ↗

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 ↗

OMD monitors stock market dynamics through matrix trajectories and reveals crisis patterns.

problem Understanding and predicting stock market crises and sector rotations.
method Applying OMD to S\&P 500 returns over three crises, analyzing distance matrices and their spectra.
result Market dynamics show coherent changes during crises, with distinct sector leadership.

OMD monitors stock market dynamics through matrix trajectories, revealing crisis patterns and sector rotations.

problem Understanding and predicting stock market dynamics during crises.
method Applying OMD to S&P 500 returns over three crises, analyzing distance matrices and their spectra.
result Market dynamics show coherent changes during crises, with sector-specific patterns and volatility clustering.

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.

Historical documents present many challenges for offline handwriting recognition systems, among them, the segmentation and labeling steps. Carefully annotated textlines are needed to train an HTR system. In some scenarios, transcripts are only available at the paragraph level with no text-line information. In this work…

2018-11-10abs ↗pdf ↗