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

Trend · papers per month

105210314419 · Jun 202019922001200920172026
48 results for information overload

Summarizes financial news for better investment decisions.

problem Information overload from financial news hinders timely investment decisions.
method Personalized Chain-of-Thought summarization framework integrating user-specified keywords.
result Personalized summaries highlight relevant market signals, improving investment narratives.

Galactica learns from scientific literature to help researchers.

problem Information overload in scientific literature makes it hard to find useful insights.
method Trained on a large corpus of scientific papers, reference material, and knowledge bases.
result Outperforms existing models on various scientific tasks, including LaTeX equations and mathematical reasoning.

PowRL uses RL to manage power grids robustly, reducing overloads and maintaining power reliability.

problem Managing transient stability and preventing blackouts in power networks with uncertain generation and load demands.
method PowRL leverages a novel heuristic for overload management and RL-guided topology selection to ensure safe and reliable operation.
result PowRL outperforms other agents in L2RPN challenges, demonstrating robust performance in various scenarios.

This paper considers the problem of low-dimensional visualisation of very high dimensional information sources for the purpose of situation awareness in the maritime environment. In response to the requirement for human decision support aids to reduce information overload (and specifically, data amenable to inter-point…

2014-02-19abs ↗pdf ↗

Study improves summarization reliability in risky scenarios.

problem Reliability of automatic summarization in high-risk contexts.
method Conditional generation with Bayesian inference and entropy regularization.
result Significant improvement in robustness and reliability of summarization.

Automatic text summarization tools have a great impact on many fields, such as medicine, law, and scientific research in general. As information overload increases, automatic summaries allow handling the growing volume of documents, usually by assigning weights to the extracted phrases based on their significance in th…

2019-06-26abs ↗pdf ↗

New method improves deep CCA by modeling private components conditionally independent of common factors.

problem Discovering latent co-variation in multiview datasets with weak common factors.
method Proposes a novel formulation that models private components conditionally independent of common factors.
result Validates the approach with synthetic and real datasets, showing improved identification of common factors.

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.

Recommender systems play a crucial role in mitigating the problem of information overload by suggesting users' personalized items or services. The vast majority of traditional recommender systems consider the recommendation procedure as a static process and make recommendations following a fixed strategy. In this paper…

2017-12-30abs ↗pdf ↗

Opinions and beliefs determine the evolution of social systems. This is of particular interest in finance, as the increasing complexity of financial systems is coupled with information overload. Opinion formation, therefore, is not always the result of optimal information processing. On the contrary, agents are bounded…

2014-08-01abs ↗pdf ↗

Simplified geometric derivation of quantum A-polynomials for knots.

problem Deriving quantum A-polynomials for knots in a simple geometric way.
method Geometric derivation using Ward identities in Chern-Simons theory, contact geometry, and Kauffman calculus.
result Simplified presentation of quantum A-polynomials, making them accessible to a broader audience.

Enhances deep learning by boosting generalization and convergence.

problem Improving generalization and convergence in deep learning models.
method Implicit Regularization Enhancement (IRE) framework that decouples flat and sharp directions.
result IRE consistently improves generalization performance across various deep learning tasks and models.

SARD improves adversarial robustness in two-stage L2D systems.

problem Adversarial attacks can manipulate query allocation in two-stage L2D systems.
method Introduces SARD, a convex learning algorithm with provable guarantees.
result SARD significantly improves robustness under adversarial attacks while maintaining strong clean performance.

This paper uses LLMs to improve equity stock ratings by ingesting diverse financial and news data.

problem Challenges in traditional stock rating methods, including data overload, inconsistencies, and delayed reactions.
method Application of LLMs to generate multi-horizon stock ratings using various datasets.
result LLMs enhance the accuracy and consistency of stock ratings, outperforming traditional methods in forward returns.

Developed a neural topic model for classifying COVID-19 disinformation.

problem Tackles the challenge of disinformation during the COVID-19 pandemic.
method Classification-aware neural topic model (CANTM) for COVID-19 disinformation.
result Demonstrated the effectiveness of CANTM in classifying COVID-19 disinformation.

Automates detection of fast-ramped flexibility events for DSOs.

problem Monitoring and supervising flexibility activations in power systems.
method Unsupervised detection and open-set classification.
result Automatically identifies critical flexibility activations for early intervention.

Collectively, machine learning (ML) researchers are engaged in the creation and dissemination of knowledge about data-driven algorithms. In a given paper, researchers might aspire to any subset of the following goals, among others: to theoretically characterize what is learnable, to obtain understanding through empiric…

2018-07-09abs ↗pdf ↗

The paper studies how adding a 'Gauge Mass' term breaks gauge symmetry in Yang-Mills-Higgs systems and analyzes the resulting behavior.

problem Breaking gauge symmetry in Yang-Mills-Higgs systems.
method Analyzing the asymptotic behavior of the system with a 'Gauge Mass' term added.
result The system's behavior is characterized by concentration phenomena and convergence to harmonic maps and minimal energies.

We simplify information measure computation using learned features.

problem Computing information measures from raw data is computationally expensive.
method Developed a separable design for computing information measures from learned feature representations.
result A variety of information measures can be computed efficiently through learned feature representations.

An asymmetric information model is introduced for the situation in which there is a small agent who is more susceptible to the flow of information in the market than the general market participant, and who tries to implement strategies based on the additional information. In this model market participants have access t…

2008-07-08abs ↗pdf ↗

We study a simple model of an asset market with informed and non-informed agents. In the absence of non-informed agents, the market becomes information efficient when the number of traders with different private information is large enough. Upon introducing non-informed agents, we find that the latter contribute signif…

2010-04-28abs ↗pdf ↗

New method quantifies redundant information using information bottleneck.

problem Quantifying redundant information among multiple sources.
method Formulated as an information bottleneck problem, termed redundancy bottleneck.
result Extracts information that best predicts the target without revealing source identity.

We propose a new framework for reasoning about information in complex systems. Our foundation is based on a variational extension of Shannon's information theory that takes into account the modeling power and computational constraints of the observer. The resulting \emph{predictive V\mathcal{V}-information} encompasse…

2020-02-25abs ↗pdf ↗

Review of information plane analyses in neural networks, highlighting mixed results and methodological challenges.

problem Understanding the relationship between information-theoretic compression and neural network performance.
method Literature review and detailed analysis of information quantity estimation methods.
result Information plane compression is not necessarily information-theoretic but compatible with geometric compression.

Information theory provides a mathematical foundation to measure uncertainty in belief. Belief is represented by a probability distribution that captures our understanding of an outcome's plausibility. Information measures based on Shannon's concept of entropy include realization information, Kullback-Leibler divergenc…

2019-11-21abs ↗pdf ↗

In financial markets valuable information is rarely circulated homogeneously, because of time required for information to spread. However, advances in communication technology means that the 'lifetime' of important information is typically short. Hence, viewed as a tradable asset, information shares the characteristics…

2011-06-28abs ↗pdf ↗

Introduces relative information gain for improving Gaussian process regression rates.

problem Improving the sample complexity of estimating or maximizing unknown functions.
method Introduces relative information gain, interpolates between effective dimension and information gain, and proves PAC-Bayesian bounds.
result Obtains minimax-optimal rates of convergence through the relative information gain.