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

Trend · papers per month

88175263350 · Jun 202019922001200920172026
48 results for Consistency Issues

This work examines consistency issues in Gaussian Mixture Model reduction algorithms.

problem Consistency issues in Gaussian Mixture Model reduction algorithms.
method Discussion of the importance of dissimilarity measure choice and consistency of GMR algorithms.
result Most existing GMR algorithms are not consistent with a unique measure, leading to suboptimal reduced GMs.

Recurrent models can produce infinite sequences, causing bias; new methods prevent this.

problem Inconsistency in decoding infinite-length sequences from recurrent language models.
method Defined and proved inconsistency of common decoding algorithms; proposed remedies.
result Proposed methods prevent inconsistency in practice.

Graph Random Neural Network improves semi-supervised learning on graphs.

problem Over-smoothing, non-robustness, and weak-generalization in GNNs with few labeled nodes.
method Random propagation strategy and consistency regularization.
result Significantly outperforms state-of-the-art GNN baselines on semi-supervised node classification.

In this paper we study the consistency of an empirical minimum error entropy (MEE) algorithm in a regression setting. We introduce two types of consistency. The error entropy consistency, which requires the error entropy of the learned function to approximate the minimum error entropy, is shown to be always true if the…

2014-12-17abs ↗pdf ↗

Unified framework for variable selection in model-based clustering with missing data.

problem Challenges in identifying relevant variables and handling missing data in model-based clustering.
method Unified framework incorporating a data-driven penalty matrix and a mechanism for missingness modeling.
result Achieves both asymptotic consistency and selection consistency in the presence of missing data.

DGPs with variational inference suffer from SNR issues that degrade gradient estimates, leading to unreliable training.

problem SNR issues in gradient estimates for DGPs with variational inference.
method Adapted doubly reparameterized gradient estimators for DGP training.
result Fix improves predictive performance of DGP models.

Improves GAN-based semi-supervised learning with consistency regularization.

problem Lack of consistency in class probability predictions under local perturbations.
method Introduces consistency regularization to GANs, leveraging both local and interpolation consistency.
result Significantly improves performance and achieves new state-of-the-art results.

Develops an online Gaussian process method that maintains convergence guarantees without sample complexity issues.

problem The computational intractability of Gaussian processes with streaming data.
method Parsimonious Online Gaussian Processes (POG) that maintains asymptotic consistency with bounded memory.
result POG preserves convergence guarantees to the population posterior with finite memory, even for constant error radius.

Although there has been substantial research in software analytics for effort estimation in traditional software projects, little work has been done for estimation in agile projects, especially estimating user stories or issues. Story points are the most common unit of measure used for estimating the effort involved in…

2016-09-02abs ↗pdf ↗

Paper introduces a new sampling method combining Consistency Models with importance sampling.

problem Inherent errors in samples and high NFEs for high-quality samples in Boltzmann distributions.
method Combines Consistency Models with importance sampling to produce unbiased samples with minimal NFEs.
result Produces unbiased samples using only 6-25 NFEs, comparable to 100 NFEs for DDPMs.

Key to multitask learning is exploiting relationships between different tasks to improve prediction performance. If the relations are linear, regularization approaches can be used successfully. However, in practice assuming the tasks to be linearly related might be restrictive, and allowing for nonlinear structures is …

2017-05-23abs ↗pdf ↗

This paper is dedicated to the construction of high-order (in both space and time) finite-difference schemes for both forward and backward PDEs and PIDEs, such that option prices obtained by solving both the forward and backward equations are consistent. This approach is partly inspired by Andreasen & Huge, 2011 who re…

2014-03-07abs ↗pdf ↗

In this paper we introduce score embedding, a neural network based model to learn interpretable vector representations for words. Score embedding is a supervised method that takes advantage of the labeled training data and the neural network architecture to learn interpretable representations for words. Health care has…

2019-08-19abs ↗pdf ↗

A new method for unsupervised domain adaptation using manifold learning.

problem Leveraging rich source domain information to target domain without labeled data.
method Discriminative Manifold Embedding and Alignment framework.
result Consistent transferability and discriminability achieved through manifold metric alignment.

In this paper, we introduce a novel method to generate interpretable regression function estimators. The idea is based on called data-dependent coverings. The aim is to extract from the data a covering of the feature space instead of a partition. The estimator predicts the empirical conditional expectation over the cel…

2019-07-04abs ↗pdf ↗

We examine overlapping clustering schemes with functorial constraints, in the spirit of Carlsson--Memoli. This avoids issues arising from the chaining required by partition-based methods. Our principal result shows that any clustering functor is naturally constrained to refine single-linkage clusters and be refined by …

2016-08-15abs ↗pdf ↗

Improved diffusion models for inverse problems by integrating data consistency constraints.

problem Errors in earlier steps of diffusion models during posterior sampling.
method Guided Decoupled Posterior Sampling (GDPS) with data consistency constraint.
result GDPS achieves state-of-the-art performance, improving accuracy over existing methods.

Proposes a new multi-view graph learning framework to model consistency and inconsistency.

problem Graph learning methods often neglect inconsistency across multiple views, making them vulnerable to noisy datasets.
method Proposes a unified objective function to simultaneously model consistency and inconsistency, iteratively learning consistent and unified graphs.
result Demonstrates robustness and efficiency of the proposed approach on twelve multi-view datasets.

To date, testing interactions in high dimensions has been a challenging task. Existing methods often have issues with sensitivity to modeling assumptions and heavily asymptotic nominal p-values. To help alleviate these issues, we propose a permutation-based method for testing marginal interactions with a binary respons…

2012-06-27abs ↗pdf ↗

Multi-expert L2D underfits more severely, requiring new methods.

problem Underfitting in multi-expert L2D settings.
method PiCCE (Pick the Confident and Correct Expert), a surrogate-based method.
result PiCCE effectively reduces multi-expert L2D to a single-expert-like problem, resolving underfitting.

Improved continuous-time consistency models for large-scale image generation.

problem Training instability and discretization errors in existing diffusion models.
method Unified theoretical framework, improved diffusion process, and network architecture.
result Trained continuous-time CMs at 1.5B parameters, achieving state-of-the-art FID scores.

New method offsets DML's error-compounding issue and provides more stable causal parameter estimates.

problem Estimating ATE from observational data with robustness and stability.
method Robust Causal Learning (RCL) method to offset DML's deficiencies.
result RCL estimators are more stable and perform better than DML and traditional estimators.

This paper describes a consistent and arbitrage-free pricing methodology for bespoke CDO tranches. The proposed method is a multi-factor extension to the (Li 2009) model, and it is free of the known flaws in the current standard pricing method of base correlation mapping. This method assigns a distinct market factor to…

2010-04-11abs ↗pdf ↗

The purpose of this paper relies on the study of long term yield curves modeling. Inspired by the economic litterature, it provides a financial interpretation of the Ramsey rule that links discount rate and marginal utility of aggregate optimal consumption. For such a long maturity modelization, the possibility of adju…

2014-04-07abs ↗pdf ↗

Recurrent neural networks (RNNs) have been successfully used on a wide range of sequential data problems. A well known difficulty in using RNNs is the \textit{vanishing or exploding gradient} problem. Recently, there have been several different RNN architectures that try to mitigate this issue by maintaining an orthogo…

2018-11-09abs ↗pdf ↗

Study clusters Kenyan medical insurance companies based on financial performance and reporting consistency.

problem Identifying financial health and reporting consistency in Kenyan medical insurance companies.
method Advanced clustering techniques (KMeans, DTW) on financial ratios and time series data.
result Four distinct clusters identified, each representing different financial performance and reporting consistency combinations.

We developed a novel statistical method to identify structural differences between networks characterized by structural equation models. We propose to reparameterize the model to separate the differential structures from common structures, and then design an algorithm with calibration and construction stages to identif…

2018-07-26abs ↗pdf ↗