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…
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,051 papers · 148 categories
Trend · papers per month
48 results for “reading list generation”
What Should I Learn First: Introducing LectureBank for NLP Education and Prerequisite Chain Learningcs.CY
LectureBank helps students find the right NLP course sequence.
problem Finding the right NLP course sequence for students with no background.
method Embedding-based method and neural graph-based networks to learn prerequisite relations.
result LectureBank dataset aids in educational and application purposes.
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…
Surveying risk measures for handling uncertainty in various fields.
problem Handling uncertainty in engineering and data-driven problems.
method Review of risk measures and their applications.
result Rapid development and widespread use of risk measures.
Book teaches how Lagrangian torus fibration base geometry can be read off.
problem Understanding geometry of Lagrangian torus fibrations.
method Integral affine structure on fibration base for total space geometry.
result Read off interesting geometry of total space from base.
Configurations of skew linesmath.GT
This paper is an updated version of a survey on projective configurations of subspaces in general position. The preceding version was published in Russian in 1989 and in English in 1990 (in Leningrad Math. J.) opening a new section ``Light reading for the professional''. The paper is written in the form of introduction…
A pedagogical but concise overview of fiber bundles and their connections is provided, in the context of gauge theories in physics. The emphasis is on defining and visualizing concepts and relationships between them, as well as listing common confusions, alternative notations and jargon, and relevant facts and theorems…
Share prices of financial companies from the S&P 500 list have been modeled by a linear function of consumer price indices in the USA. The Johansen and Engle-Granger tests for cointegration both demonstrated the presence of an equilibrium long-term relation between observed and predicted time series. Econometrically, t…
Structural-Jump-LSTM speeds up reading by skipping and jumping text.
problem Sequential inference in RNNs makes reading time linearly dependent on input length.
method Introduces a novel LSTM model with agents for skipping and jumping text.
result Structural-Jump-LSTM achieves best FLOP reduction and maintains or improves accuracy.
Dataset for measuring reading levels in India's children.
problem Measuring reading levels in India's vast population.
method Developed ASER dataset with 5,301 subjects in Hindi, Marathi, and English.
result Achieved 86% accuracy in English language classification.
Application of Markov Structure of Genomes to Outlier Identification and Read Classificationq-bio.GN
Paper uses genome Markov structure for outlier detection and read classification.
problem Identifying outliers and classifying reads in genome databases.
method Applying second-order Markov models to triplet base distributions.
result Improved accuracy in outlier identification and read classification.
This article reviews forecasting theory and practice.
problem Forecasting uncertainty and challenges in decision making.
method Overview of forecasting models, principles, and applications.
result Encyclopedic presentation of forecasting theory and practice.
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.
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.
New approach speeds up DNA sequence alignment.
problem Efficiently estimating alignment scores for large sets of reads.
method Rank-one crowdsourcing models and multi-armed bandit algorithm.
result Adaptive algorithm identifies pairs with large alignment scores.
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.
Most work in machine reading focuses on question answering problems where the answer is directly expressed in the text to read. However, many real-world question answering problems require the reading of text not because it contains the literal answer, but because it contains a recipe to derive an answer together with …
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.
Characterizes the sample complexity of list regression tasks.
problem Understanding the sample complexity of list learning tasks in regression.
method Introducing two combinatorial dimensions: k-OIG dimension and k-fat-shattering dimension.
result These dimensions characterize realizable and agnostic k-list regression.
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.
This work characterizes when a hypothesis class can be k-list learned.
problem Characterizing when a hypothesis class can be k-list learned.
method Introducing the k-DS dimension and proving the equivalence of k-list learnability and the finiteness of the k-DS dimension.
result A hypothesis class is k-list learnable if and only if the k-DS dimension is finite.
Investigates principles of generalization in list learning, refutes sample compression conjecture.
problem Determining applicability of classical principles in list PAC learning.
method Examines uniform convergence and sample compression in list PAC learning.
result Sample compression fails in list PAC learning, refutes conjecture.
A novel conLSH algorithm improves alignment of noisy SMRT reads.
problem High error probability in SMRT sequencing data.
method Context-based Locality Sensitive Hashing (conLSH) for efficient alignment.
result Comprehensive improvement in speed and memory requirements compared to rHAT.
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…
META 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.
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…
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.
Model generates label-dependent paraphrases for NLP tasks.
problem Generating semantically different paraphrases for NLP tasks.
method Deep variational model with label-dependent generation.
result Model improves generative power of paraphrasing models.
Directional Decision Listsstat.ML
In this paper we introduce a novel family of decision lists consisting of highly interpretable models which can be learned efficiently in a greedy manner. The defining property is that all rules are oriented in the same direction. Particular examples of this family are decision lists with monotonically decreasing (or i…
How Much Reading Does Reading Comprehension Require? A Critical Investigation of Popular Benchmarkscs.CL
Many recent papers address reading comprehension, where examples consist of (question, passage, answer) tuples. Presumably, a model must combine information from both questions and passages to predict corresponding answers. However, despite intense interest in the topic, with hundreds of published papers vying for lead…
Research on predicting with lists of labels, characterizing learnability and providing algorithms.
problem Multiclass online prediction with multiple labels.
method Characterization using -ary Littlestone dimension, adaptation of classical algorithms, combinatorial results.
result Achievement of negative regret in some scenarios, complete characterization of learnability.
Polynomial-time algorithm for list-decodable linear regression with batches.
problem Efficiently decoding linear regression with a fraction of adversarial data.
method Polynomial time algorithm using batches of i.i.d. samples.
result Returns a list of size O(1/α^2) with one item close to true parameter.
We show how the rotation and translation fields of a surface, introduced by G. Darboux, may be used to obtain short proofs of a well-known theorem (that reads that the total mean curvature of a surface is stationary under an infinitesimal bending) and a new theorem (that reads that every infinitesimal flex of any simpl…
The outcome of a functional genomics pipeline is usually a partial list of genomic features, ranked by their relevance in modelling biological phenotype in terms of a classification or regression model. Due to resampling protocols or just within a meta-analysis comparison, instead of one list it is often the case that …
Graph database outperforms in filtering ESG stocks efficiently.
problem Efficiently filtering ESG stocks from large lists of equities.
method Compared SQL, No-SQL, and graph databases; used Python for database interactions; collected data from stock price and financial news.
result Graph database is more efficient for ESG stock filtering.
EMR learns to read and remember from streaming data for QA.
problem Scalable QA from streaming data without knowing questions.
method End-to-end deep network model (EMR) with RL agent for memory management.
result EMR achieves significant improvements over existing methods on synthetic and real-world datasets.
Paper tackles high-accuracy list-decodable learning for mean estimation.
problem Estimate the mean of a distribution with a small fraction coming from a nice distribution.
method Developed a novel proof of identifiability and a new algorithmic approach.
result Achieved high-accuracy guarantees for list-decodable mean estimation.
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.
Cartan's list of 3-dimensional Weyl structures with reduced holonomy is revisited. We show that the only Einstein-Weyl structures on this list correspond to the structures generated by the solutions of the dKP equation.
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 paper examines the Chinese market reaction to the ADR issue by comparing returns and their stochastic variances of the Chinese firms cross-listed in the U.S. stock market. First, It was implemented capital asset pricing model (CAPM) to determine expected returns A and N shares. The CAPM provided with a methodology …
New method combines score lists using joint CDFs, improving computation.
problem Combining non-comparable score lists over a common index set.
method New algorithm for computing joint CDF values, linear runtime.
result Improved computation of joint CDF values for N-dimensional order statistics.
The covariance graph (aka bi-directed graph) of a probability distribution is the undirected graph where two nodes are adjacent iff their corresponding random variables are marginally dependent in . In this paper, we present a graphical criterion for reading dependencies from , under the assumption that $…
MAMMO reduces radiologist workload by triaging mammograms, improving accuracy.
problem Reducing radiologist workload while maintaining diagnostic accuracy.
method Developed a clinical decision support system with a multi-task learning CNN and triage network.
result Reduced radiologist workload by 42.8% with improved overall diagnostic accuracy.
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…
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,…
Study on list learning with noisy data, showing limits and some learnable cases.
problem Learning from noisy data in a list learning context.
method Inspired by coding theory, extends list learning model to study sparse conjunctions and parities/majors.
result Sparse conjunctions can be efficiently list learned under certain conditions, but parities and majors cannot be efficiently learned.
Bandana stores deep learning models using NVM with DRAM caching.
problem Reducing memory footprint of deep learning models stored on DRAM.
method Uses NVM as primary storage, DRAM as cache, hypergraph partitioning, and cache simulation.
result Significantly reduces the cost of ownership for storing deep learning models.