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.

169,051 papers · 148 categories

Trend · papers per month

3.7%7.4%11.1%14.7% · Jun 202519922001200920182026
48 results for probabilistic key phrase

Deep neural networks improve music phrase segmentation.

problem Automated melodic phrase detection and segmentation in music.
method Adapted various neural network architectures to symbolic music representation, addressing sparse labeling problem.
result CNN-CRF architecture performs best, offering finer segmentation and faster training.

Model learns image-word associations from captions using contrastive learning.

problem Phrase grounding, associating image regions to caption words.
method Optimizing word-region attention to maximize mutual information, using language model guided word substitutions for negatives.
result Model achieves 76.7% accuracy on Flickr30K Entities benchmark, a 5.7% gain from weak supervision.

NP2^2MT uses phrase attention to translate phrases efficiently.

problem Phrase-based machine translation inefficiency and performance degradation across different distributions.
method Phrase attention mechanism and dynamic programming for efficient decoding.
result NP2^2MT achieves comparable performance and outperforms state-of-the-art methods in certain conditions.

New method combines ODE solvers with Bayesian inference for efficient model training.

problem Combining ODE solvers with Bayesian inference for efficient model training.
method Probabilistic state space model using extended Kalman filter for joint inference from differential equations and data.
result Efficient approximate Bayesian inference on latent force and ODE solution.

Equivalence relations can be defined on Gauss phrases using combinatorial moves. In this paper we consider two closely related equivalence relations on Gauss phrases, homotopy and open homotopy. In particular, in each case, we define a new invariant and determine the values that it can attain.

2008-10-24abs ↗pdf ↗

In this paper, we present Neural Phrase-based Machine Translation (NPMT). Our method explicitly models the phrase structures in output sequences using Sleep-WAke Networks (SWAN), a recently proposed segmentation-based sequence modeling method. To mitigate the monotonic alignment requirement of SWAN, we introduce a new …

2017-06-17abs ↗pdf ↗

V. Turaev introduced the theory of topology of words and phrases in 2005. This is a combinatorialy extension of the theory of virtual knots and links. In this paper we generalize the notion of homotopy of words and phrases and we give geometric meanings of the generalized homotopy of words. Moreover using the generaliz…

2009-08-20abs ↗pdf ↗

Proposes a new neural network for text-dependent speaker verification.

problem Improves speaker verification by encoding phrase and speaker information.
method Uses differentiable alignment models to produce supervectors from utterances.
result Achieves competitive performance in text-dependent speaker verification tasks.

Unsupervised scheme ranks sentences in text documents based on semantic importance.

problem Ranking sentences in text documents without labeled data.
method Extracts essential words and phrases, constructs semantic phrase and sentence graphs, applies PageRank, combines scores, and optimizes for topic diversity.
result SSR outperforms individual judges and compares favorably with combined rankings on benchmarks.

Text2Node maps medical phrases to a taxonomy, overcoming coding standard limitations.

problem Limited data interchangeability between EHR systems due to different coding standards.
method Text2Node uses word and node embeddings, along with mapping functions, to generalize from limited training data.
result Text2Node achieves high accuracy in mapping phrases to a taxonomy, even for unseen concepts.

We continue our previous work studying critical exponent semilinear elliptic (and subelliptic) problems which generalize the classical Yamabe problem. In [3] the focus was on metric-measure spaces with an `almost smooth' structure, with stratified spaces furnishing the key examples. The criterion for solvability there …

2013-06-18abs ↗pdf ↗

Segmental structure is a common pattern in many types of sequences such as phrases in human languages. In this paper, we present a probabilistic model for sequences via their segmentations. The probability of a segmented sequence is calculated as the product of the probabilities of all its segments, where each segment …

2017-02-24abs ↗pdf ↗

We cast Amari's natural gradient in statistical learning as a specific case of Kalman filtering. Namely, applying an extended Kalman filter to estimate a fixed unknown parameter of a probabilistic model from a series of observations, is rigorously equivalent to estimating this parameter via an online stochastic natural…

2017-03-01abs ↗pdf ↗

We study information theoretic methods for ranking biomarkers. In clinical trials there are two, closely related, types of biomarkers: predictive and prognostic, and disentangling them is a key challenge. Our first step is to phrase biomarker ranking in terms of optimizing an information theoretic quantity. This formal…

2016-12-05abs ↗pdf ↗

We find the maximum mutual information for neural networks and its key determinants.

problem Understanding the maximum mutual information in neural architectures.
method Derived closed-form expression for maximum mutual information across neural network families.
result Maximum mutual information stems from a generalized formula and is influenced by network width and statistical invariances.

We study topological structures of the sets (0,1/2)3Ω(0,1/2)^3 \cap Ω and (0,1/2)3Ω(0,1/2)^3 \setminus Ω, where~ΩΩ is one special algebraic surface defined by a symmetric polynomial in variables a1,a2,a3a_1,a_2,a_3 of degree~1212. These problems arise in studying of general properties of degenerate singular points of dynamical systems ob…

2014-11-21abs ↗pdf ↗

This paper improves neural network explanations by quantifying and visualizing semantic compositions.

problem Improving neural network explanations for natural language processing tasks.
method Proposes a formal way to quantify word and phrase importance, introduces SCD and SOC algorithms.
result Our algorithms outperform prior methods in explaining neural network predictions.

This new research explores the effects of various training methods on a Polish to English Statistical Machine Translation system for medical texts. Various elements of the EMEA parallel text corpora from the OPUS project were used as the basis for training of phrase tables and language models and for development, tunin…

2015-09-29abs ↗pdf ↗

Although deep learning models have proven effective at solving problems in natural language processing, the mechanism by which they come to their conclusions is often unclear. As a result, these models are generally treated as black boxes, yielding no insight of the underlying learned patterns. In this paper we conside…

2017-02-08abs ↗pdf ↗

This review explores probabilistic forecasting methods in evolving energy markets.

problem Volatility and uncertainty in renewable energy markets require probabilistic forecasting for risk assessment.
method Traces evolution from Bayesian and distribution-based approaches to conformal prediction.
result Probabilistic forecasting offers a more comprehensive approach to risk assessment and market participation.

Probabilistic models can handle causal inference without special tools.

problem Confusion over necessary tools for causal inference.
method Demonstrated through concrete examples that causal questions can be answered using standard probabilistic models.
result Causal questions can be addressed using standard probabilistic modelling and inference.

Study shows mutual information can reward structure learning agents without expert systems.

problem Designing rewards for structure learning agents in natural language environments.
method Revisited Information Theory of unsupervised induction of phrase-structure grammars, using random sets of linguistic samples.
result Empirical evidence that simulated semantic structures can be distinguished from random ones by mutual information among their constituents.

We investigate cobordisms of free knots. Free knots and links are also called homotopy classes of Gauss words and phrases. We define a new strong invariant of free knots which allows to detect free knots not cobordant to the trivial one.

2009-04-18abs ↗pdf ↗

Paper analyzes word embedding composition using tensor decomposition.

problem Given vector representations of two words, compute a vector for the entire phrase.
method Generative model with low rank Tucker decomposition of word embedding correlations.
result Word embeddings and a core tensor can be derived from the Tucker decomposition.

New approach improves linear-time attention for language models.

problem Challenges of quadratic attention in long-sequence modelling, especially for discrete data.
method Reinterpreting linear attention through latent probabilistic graphical models, introducing asymmetric structure and recurrent parameterisation.
result Our model achieves competitive performance and outperforms existing linear attention variants on language modelling benchmarks.

New bound on partition function proves Kähler-Einstein stability.

problem Proving Kähler-Einstein metrics on complex manifolds.
method Quantitative bound on partition function, connecting probabilistic and quantization approaches.
result Direct analytic proof of Kähler-Einstein stability for uniformly Gibbs stable manifolds.

pRSL combines probabilistic rules to improve multi-label classification.

problem Modeling the structure between multi-label classes for better performance.
method Uses probabilistic propositional logic rules and belief propagation to combine predictions from multiple classifiers.
result pRSL achieves state-of-the-art performance on various benchmark datasets.

Objective: We investigate whether deep learning techniques for natural language processing (NLP) can be used efficiently for patient phenotyping. Patient phenotyping is a classification task for determining whether a patient has a medical condition, and is a crucial part of secondary analysis of healthcare data. We ass…

2017-03-25abs ↗pdf ↗

New method finds all thin film structures from reflectometry data.

problem Computational prohibitive for standard algorithms, leading to unreliable analysis.
method Prior-Amortized Neural Posterior Estimation (PANPE) combining simulation-based inference and adaptive priors.
result Identifies all realistic structures in seconds, setting new standards in reflectometry.

Study proposes new methods to calculate probabilistic benchmarks in noisy data.

problem Identifying opportunities for improvement in comparable units with noisy data.
method 2-step methodology involving undersampling and relevance vector machine.
result Higher discrimination power achieved with macro-economic environment variables.