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

12253749 · Apr 202019922001200920182026
48 results for Segmental CRF

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.

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.

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 ↗

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 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 ↗

The simplicity of gradient descent (GD) made it the default method for training ever-deeper and complex neural networks. Both loss functions and architectures are often explicitly tuned to be amenable to this basic local optimization. In the context of weakly-supervised CNN segmentation, we demonstrate a well-motivated…

2018-09-07abs ↗pdf ↗

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 ↗

Paper tackles brain tumor segmentation using weak labels and hierarchical training.

problem High manual labeling effort for fully supervised brain tumor segmentation.
method Uses scribbles and global labels for weak supervision, trains two networks in phases.
result Achieves competitive results on brain tumor segmentation and substructure segmentation.

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 ↗

Graph convolutional networks refine organ segmentation using uncertainty analysis.

problem Challenges in organ segmentation due to variability and tissue similarity.
method Uncertainty analysis of graph convolutional networks for semi-supervised learning.
result Improved segmentation accuracy (1% for pancreas, 2% for spleen) compared to state-of-the-art methods.

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 ↗

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.

Neural approaches to sequence labeling often use a Conditional Random Field (CRF) to model their output dependencies, while Recurrent Neural Networks (RNN) are used for the same purpose in other tasks. We set out to establish RNNs as an attractive alternative to CRFs for sequence labeling. To do so, we address one of t…

2018-09-30abs ↗pdf ↗

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 ↗

NL-LinkNet improves road extraction from satellite images with fewer parameters and faster training.

problem Efficiently extracting roads from high-resolution satellite images.
method Integrates non-local blocks into LinkNet for better feature context.
result NL-LinkNet outperformed state-of-the-art models in the DeepGlobe Challenge.

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.

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.

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 ↗

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.