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

Trend · papers per month

6.3%12.5%18.8%25.0% · Apr 199419922001200920172026
48 results for Noisy reads

In an end-to-end dialog system, the aim of dialog state tracking is to accurately estimate a compact representation of the current dialog status from a sequence of noisy observations produced by the speech recognition and the natural language understanding modules. This paper introduces a novel method of dialog state t…

2016-06-13abs ↗pdf ↗

Neural models often incorrectly predict the same answer to subtly changed questions, even when they should not.

problem Neural models' oversensitivity to adversarial question changes.
method Formulated a noisy adversarial attack to identify and exploit undersensitivity, tested with data augmentation and adversarial training.
result Undersensitivity can be exploited to mislead models, and addressing it improves model performance and robustness.

Semi-supervised deep learning detects problematic reads for genome assembly.

problem De novo genome assembly is hindered by specific types of reads.
method Analysis of coverage graphs converted to 1D-signals using semi-supervised deep learning models.
result Semi-supervised deep learning models can detect problematic reads with minimal labeled data.

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.

Paper explores zero-shot cross-lingual reading comprehension using pre-trained multi-lingual model.

problem Lack of training data for every language in reading comprehension tasks.
method Systematic exploration of zero-shot cross-lingual transfer learning with a multi-lingual language representation model.
result Zero-shot cross-lingual transfer learning is feasible and translating source data into target language is not necessary.

QAInfomax improves reading comprehension by maximizing mutual information, achieving state-of-the-art performance.

problem Distractor sentences in question answering datasets are hard to distinguish from relevant ones.
method QAInfomax regularizes reading comprehension models to learn mutual information among passages, questions, and answers.
result QAInfomax achieves state-of-the-art performance on Adversarial-SQuAD dataset.

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 ↗

META2^\mathbf{2} improves taxonomic classification and abundance estimation in metagenomics with deep learning and memory efficiency.

problem Memory constraints and inefficiencies in taxonomic classification and abundance estimation for metagenomics.
method Developed a novel memory-efficient read classification technique combining deep learning and locality-sensitive hashing, and formulated abundance estimation as a Multiple Instance Learning problem.
result Our approach outperforms conventional methods in both single-read taxonomic classification and abundance estimation, especially when memory is limited.

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 ↗

Semi-supervised model removes noisy content from webpages.

problem Extracting relevant content from webpages with ads and noise.
method Graph representation of webpage, semi-supervised learning with Gaussian Random Fields.
result Preliminary results show successful extraction of relevant content.

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 ↗

Scarcity of labeled data is one of the most frequent problems faced in machine learning. This is particularly true in relation extraction in text mining, where large corpora of texts exists in many application domains, while labeling of text data requires an expert to invest much time to read the documents. Overall, st…

2018-07-12abs ↗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 ↗

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.

Model learns to discover and disambiguate entities and relations in text streams.

problem Learning to follow and resolve mentions in a continuous text stream.
method End-to-end trainable memory network for online, one-shot learning.
result Improves disambiguation and discovery skills with minimal supervision.

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.

Estimates latent dimensionality for prediction tasks using mutual information.

problem Estimating the latent dimensionality needed for accurate prediction.
method Formulates the problem as an Information Bottleneck question and uses neural mutual information estimators with a hybrid critic to preserve latent geometry.
result The hybrid critic method provides a more accurate estimation of task-relevant dimensionality.

A framework for navigating environments with spatially correlated obstacles and uncertain blockage status.

problem Navigation in environments with spatially correlated obstacles of uncertain blockage status.
method Modeling spatial correlation with Gaussian Random Field, developing Bayesian belief updates, proposing a two-stage learning framework with offline and online phases.
result Consistent performance gains over baselines in environments with adversarial interruptions or clustered natural hazards.

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 ↗

Due to limited metering infrastructure, distribution grids are currently challenged by observability issues. On the other hand, smart meter data, including local voltage magnitudes and power injections, are communicated to the utility operator from grid buses with renewable generation and demand-response programs. This…

2016-12-20abs ↗pdf ↗

Study shows context-specific models improve swipe gesture authentication for smartphone users.

problem Improving swipe gesture-based continuous authentication for smartphones.
method Conducted experiments on HMOG dataset with 100 subjects, analyzing authentication error in different scenarios.
result Context-specific models are needed for different smartphone usage and human activity scenarios.

The ability to use a 2D map to navigate a complex 3D environment is quite remarkable, and even difficult for many humans. Localization and navigation is also an important problem in domains such as robotics, and has recently become a focus of the deep reinforcement learning community. In this paper we teach a reinforce…

2017-11-20abs ↗pdf ↗

This note is purely expository. In the course of the Kolmogorov-Arnold solution of Hilbert's 13th problem on superpositions there appeared the notion of basic embedding. A subset K of R^2 is basic if for each continuous function f:K->R there exist continuous functions g,h:R->R such that f(x,y)=g(x)+h(y) for each point …

2010-03-08abs ↗pdf ↗

CopyCAT attacks neural policies by manipulating observations, not states.

problem Adversarial attacks on neural reinforcement learning agents.
method CopyCAT is a targeted attack that lures agents into following outsider policies.
result CopyCAT is effective in a read-only setting where adversaries can only manipulate observations.