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

Trend · papers per month

12.5%25.0%37.5%50.0% · Apr 199419922001200920172026
48 results for separable topic discovery

A new method selects anchor words for better topic discovery in text corpora.

problem Selecting anchor words for improved topic modeling in text corpora.
method Proposes a new greedy method to find a minimum edge-weight anchor clique in a word similarity graph.
result The proposed method outperforms existing methods on topic quality and is faster.

We consider the problem of separating error messages generated in large distributed data center networks into error events. In such networks, each error event leads to a stream of messages generated by hardware and software components affected by the event. These messages are stored in a giant message log. We consider …

2018-04-10abs ↗pdf ↗

We present algorithms for topic modeling based on the geometry of cross-document word-frequency patterns. This perspective gains significance under the so called separability condition. This is a condition on existence of novel-words that are unique to each topic. We present a suite of highly efficient algorithms based…

2013-03-15abs ↗pdf ↗

We propose a novel parameterized family of Mixed Membership Mallows Models (M4) to account for variability in pairwise comparisons generated by a heterogeneous population of noisy and inconsistent users. M4 models individual preferences as a user-specific probabilistic mixture of shared latent Mallows components. Our k…

2015-04-03abs ↗pdf ↗

A new geometrically-motivated algorithm for nonnegative matrix factorization is developed and applied to the discovery of latent "topics" for text and image "document" corpora. The algorithm is based on robustly finding and clustering extreme points of empirical cross-document word-frequencies that correspond to novel …

2013-01-05abs ↗pdf ↗

The last decade has seen great progress in both dynamic network modeling and topic modeling. This paper draws upon both areas to create a Bayesian method that allows topic discovery to inform the latent network model and the network structure to facilitate topic identification. We apply this method to the 467 top polit…

2016-10-18abs ↗pdf ↗

New PCstar algorithm discovers causal structure of max-linear Bayesian networks.

problem Discovering causal structure in max-linear Bayesian networks due to non-faithfulness.
method PC algorithm modified with CC^\ast-separation assumptions.
result PCstar algorithm can orient additional edges not possible with standard PC algorithm.

We introduce jet topics: a framework to identify underlying classes of jets from collider data. Because of a close mathematical relationship between distributions of observables in jets and emergent themes in sets of documents, we can apply recent techniques in "topic modeling" to extract jet topics from data with mini…

2018-01-31abs ↗pdf ↗

We propose a parsimonious topic model for text corpora. In related models such as Latent Dirichlet Allocation (LDA), all words are modeled topic-specifically, even though many words occur with similar frequencies across different topics. Our modeling determines salient words for each topic, which have topic-specific pr…

2014-01-22abs ↗pdf ↗

The majority of medical documents and electronic health records (EHRs) are in text format that poses a challenge for data processing and finding relevant documents. Looking for ways to automatically retrieve the enormous amount of health and medical knowledge has always been an intriguing topic. Powerful methods have b…

2017-05-02abs ↗pdf ↗

Since time immemorial, people have been looking for ways to organize scientific knowledge into some systems to facilitate search and discovery of new ideas. The problem was partially solved in the pre-Internet era using library classifications, but nowadays it is nearly impossible to classify all scientific and popular…

2018-11-15abs ↗pdf ↗

We present a novel method for hierarchical topic detection where topics are obtained by clustering documents in multiple ways. Specifically, we model document collections using a class of graphical models called hierarchical latent tree models (HLTMs). The variables at the bottom level of an HLTM are observed binary va…

2016-05-21abs ↗pdf ↗

Latent topic models have been successfully applied as an unsupervised topic discovery technique in large document collections. With the proliferation of hypertext document collection such as the Internet, there has also been great interest in extending these approaches to hypertext [6, 9]. These approaches typically mo…

2012-06-13abs ↗pdf ↗

The logistic normal distribution has recently been adapted via the transformation of multivariate Gaus- sian variables to model the topical distribution of documents in the presence of correlations among topics. In this paper, we propose a probit normal alternative approach to modelling correlated topical structures. O…

2014-10-03abs ↗pdf ↗

New framework models stock relationships and investor expectations for better financial market predictions.

problem Limited by predefined stock relationships and immediate effects, current financial market analysis methods need improvement.
method Jointly models investor expectations and automatically mines latent stock relationships.
result Annual return exceeds 10%, surpassing existing benchmarks.

We propose a new topic modeling procedure that takes advantage of the fact that the Latent Dirichlet Allocation (LDA) log likelihood function is asymptotically equivalent to the logarithm of the volume of the topic simplex. This allows topic modeling to be reformulated as finding the probability simplex that minimizes …

2019-04-03abs ↗pdf ↗

The paper investigates topic models, ensuring their statistical identifiability and accuracy.

problem Lack of formal theoretical investigation of topic model identifiability and estimation accuracy.
method Proposes a maximum likelihood estimator (MLE) based on integrated likelihood, introducing new geometric identifiability conditions.
result Introduces weaker conditions for topic model identifiability, allowing a broader investigation.

Topic models have been extensively used to organize and interpret the contents of large, unstructured corpora of text documents. Although topic models often perform well on traditional training vs. test set evaluations, it is often the case that the results of a topic model do not align with human interpretation. This …

2017-06-12abs ↗pdf ↗

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.

New method discovers mean and variance causal graphs from heteroscedastic data.

problem Understanding causal relationships in data with varying variance.
method Bayesian, moment-driven approach inferring separate mean and variance causal graphs.
result Accurately recovers mean and variance structures from heteroscedastic data.

We propose an algorithm for detecting patterns exhibited by anomalous clusters in high dimensional discrete data. Unlike most anomaly detection (AD) methods, which detect individual anomalies, our proposed method detects groups (clusters) of anomalies; i.e. sets of points which collectively exhibit abnormal patterns. I…

2015-12-20abs ↗pdf ↗

SubTSBR tackles noisy data for differential equation discovery.

problem Discovering differential equations from noisy or outlier-laden data.
method Subsampling-based threshold sparse Bayesian regression (SubTSBR) with subsampling size and number of subsamples.
result SubTSBR outperforms TSBR in accuracy for differential equation discovery.

New method combines gradient optimization with constraint-based techniques for causal discovery.

problem Causal discovery from observational data, especially with small sample sizes.
method Differentiable dd-separation scores using percolation theory and soft logic for gradient-based optimization of conditional independence constraints.
result Empirical evaluations show robust performance in low-sample regimes, surpassing traditional methods.

Develops a model for causal discovery in path spaces.

problem Discover causal relationships in path spaces using asymmetric independence.
method Theory linking E-separation in DMGs to conditional independence in SDEs, proving global Markov property, characterizing equivalence classes of graphs.
result Each equivalence class of graphs has a greatest element as a parsimonious representation, which can be identified from data.

NeurT-FDR controls FDR by incorporating auxiliary covariates in deep learning.

problem Controlling FDR in complex large-scale problems with indirect relations among covariates.
method NeurT-FDR uses a deep Black-Box framework that parametrizes test-level covariates as a neural network and adjusts auxiliary covariates through a regression framework.
result NeurT-FDR makes substantially more discoveries in real datasets compared to competitive baselines.