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

4079119158 · Jun 202019922001200920182026
48 results for Latent CRFs

FLDCRF improves sequence labeling performance with latent dynamics interactions.

problem Sequence labeling with improved performance and latent dynamics interactions.
method Factored Latent-Dynamic Conditional Random Fields (FLDCRF) with multiple latent dynamics interactions.
result FLDCRF outperforms state-of-the-art models across multiple datasets.

We consider the problem of training probabilistic conditional random fields (CRFs) in the context of a task where performance is measured using a specific loss function. While maximum likelihood is the most common approach to training CRFs, it ignores the inherent structure of the task's loss function. We describe alte…

2011-07-09abs ↗pdf ↗

We give several equivalent characterizations of orthogonal subbundles of the generalized tangent bundle defined, up to B-field transform, by almost product and local product structures. We also introduce a pure spinor formalism for generalized CRF-structure and investigate the resulting decomposition of the de Rham ope…

2017-01-10abs ↗pdf ↗

FGN improves Chinese NER by integrating glyph information and interactive context.

problem Chinese named entity recognition is challenging due to the complexity of characters and their glyphs.
method FGN uses a novel CGS-CNN structure to capture glyph and interactive information, and a sliding window method to fuse BERT and glyph representations.
result FGN achieves state-of-the-art performance on four NER datasets, improving over previous methods.

CAT toolkit combines hybrid and E2E approaches for efficient speech recognition.

problem Improving speech recognition efficiency and latency.
method CTC-CRF based framework with contextualized soft forgetting.
result CAT achieves state-of-the-art results with simpler training and streaming ASR.

A generalized F-structure is a complex, isotropic subbundle EE of TcMTcMT_cM\oplus T^*_cM ($T_cM=TM\otimes_{\mathds{R}}\mathds{C}$ and the metric is defined by pairing) such that EEˉ=0E\cap\bar E^{\perp}=0. If EE is also closed by the Courant bracket, EE is a generalized CRF-structure. We show that a generalized F-structur…

2007-05-27abs ↗pdf ↗

The article confirms Thurston's conjecture for a specific class of 3-manifolds using combinatorial Ricci flow.

problem Thurston's triangulation conjecture for hyperbolic 3-manifolds.
method Combinatorial Ricci flow (CRF) with specific conditions and techniques to handle intrinsic difficulties.
result A class of 3-manifolds admits a unique complete hyperbolic metric with totally geodesic boundary.

Often we wish to predict a large number of variables that depend on each other as well as on other observed variables. Structured prediction methods are essentially a combination of classification and graphical modeling, combining the ability of graphical models to compactly model multivariate data with the ability of …

2010-11-17abs ↗pdf ↗

Conditional Random Fields (CRFs) are undirected graphical models, a special case of which correspond to conditionally-trained finite state machines. A key advantage of these models is their great flexibility to include a wide array of overlapping, multi-granularity, non-independent features of the input. In face of thi…

2012-10-19abs ↗pdf ↗

In an earlier paper, we studied manifolds MM endowed with a generalized F structure ΦEnd(TMTM)Φ\in End(TM\oplus T^*M), skew-symmetric with respect to the pairing metric, such that Φ3+Φ=0Φ^3+Φ=0. Furthermore, if ΦΦ is integrable (in some well-defined sense), ΦΦ is a generalized CRF structure. In the present paper we study quasi-…

2016-04-05abs ↗pdf ↗

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.

Gaussian CRFBC model for binary classification with latent variables.

problem Binary classification problems with undirected graphs.
method Gaussian conditional random fields with latent variables, local variational approximation, Newton-Cotes formulas.
result Improved prediction performance compared to unstructured predictors.

Paper proposes neural approach for Chinese named entity recognition.

problem Challenges in Chinese named entity recognition due to context-dependency and lack of word delimiters.
method Introduces a CNN-LSTM-CRF neural architecture and a unified framework for joint training with word segmentation.
result Improves Chinese named entity recognition performance, especially with limited training data.

The paper studies a rebalanced dataset for imbalanced classification using Centered Random Forests.

problem Imbalanced classification where one class is underrepresented.
method Theoretical analysis of Centered Random Forests (CRF) with rebalanced datasets and debiasing techniques.
result Theoretical Central Limit Theorem (CLT) for the infinite CRF and debiased estimator IS-ICRF.

Deep structured output learning shows great promise in tasks like semantic image segmentation. We proffer a new, efficient deep structured model learning scheme, in which we show how deep Convolutional Neural Networks (CNNs) can be used to estimate the messages in message passing inference for structured prediction wit…

2015-06-06abs ↗pdf ↗

Scrubbing PHI data from medical records is now efficient and scalable with SpaCy.

problem Efficiency and scalability of de-identification techniques for PHI data.
method Evaluated numerous deep learning techniques including SpaCy for performance and efficiency.
result SpaCy model is both well performing and extremely efficient for PHI data scrubbing.

We introduce a conceptually novel structured prediction model, GPstruct, which is kernelized, non-parametric and Bayesian, by design. We motivate the model with respect to existing approaches, among others, conditional random fields (CRFs), maximum margin Markov networks (M3N), and structured support vector machines (S…

2013-07-15abs ↗pdf ↗

Automated extraction of concepts from patient clinical records is an essential facilitator of clinical research. For this reason, the 2010 i2b2/VA Natural Language Processing Challenges for Clinical Records introduced a concept extraction task aimed at identifying and classifying concepts into predefined categories (i.…

2016-11-25abs ↗pdf ↗

State-of-the-art sequence labeling systems traditionally require large amounts of task-specific knowledge in the form of hand-crafted features and data pre-processing. In this paper, we introduce a novel neutral network architecture that benefits from both word- and character-level representations automatically, by usi…

2016-03-04abs ↗pdf ↗

Alternative optimizer outperforms gradient descent in weakly-supervised CNN segmentation.

problem Training deep neural networks with complex loss functions.
method Demonstrated an alternative optimizer (ADM) outperforming gradient descent.
result Gradient descent performs poorly with certain loss functions, while an alternative optimizer achieves state-of-the-art results.

Method uses random forest with distance covariance for transfer learning in healthcare.

problem Transfer learning in random forests with sparse differences between source and target.
method Distance covariance-based feature weights in residual random forest.
result Upper bound on mean square error rate for transfer learning in RF.

We consider higher-order linear-chain conditional random fields (HO-LC-CRFs) for sequence modelling, and use sum-product networks (SPNs) for representing higher-order input- and output-dependent factors. SPNs are a recently introduced class of deep models for which exact and efficient inference can be performed. By com…

2018-07-06abs ↗pdf ↗

We give polynomial-time algorithms for the exact computation of lowest-energy (ground) states, worst margin violators, log partition functions, and marginal edge probabilities in certain binary undirected graphical models. Our approach provides an interesting alternative to the well-known graph cut paradigm in that it …

2008-10-24abs ↗pdf ↗

New approach uses synthetic labels to train models on scarce annotated data for surgical phase recognition.

problem Learning surgical phase recognition from limited annotated data.
method Teacher/Student approach with a CNN-biLSTM-CRF teacher generating synthetic labels for a CNN-LSTM student.
result Improved surgical phase recognition performance with fewer annotated videos.