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

Trend · papers per month

3046089111,215 · Jun 202019922001200920172026
48 results for data consistency

We improve random forest consistency and performance with DMRF, a new variant.

problem Improving the consistency and performance of random forest models.
method Developed DMRF, a data-driven multinomial random forest, by modifying proof methods and improving data utilization.
result DMRF achieves strong consistency with probability 1, surpassing previous models in classification tasks.

A new method for PU learning improves classification error on CIFAR-10.

problem Learning from positive and unlabeled data in practical applications.
method A simple yet effective data augmentation method based on consistency regularization.
result Achieves an averaged improvement of 3.40 points in classification error on CIFAR-10.

MaxMatch improves SSL with worst-case consistency for better generalization.

problem Efficiently supervised learning with unlabeled data.
method Worst-case consistency regularization for SSL, providing a bound and an algorithm.
result The proposed method converges to a stationary point and improves generalization.

Proposes a neural network method to improve consistencies in high dimensional data analysis.

problem Inconsistencies among dimensionality reduction, clustering, and visualization tasks in high dimensional data analysis.
method Consistent Representation Learning (CRL) neural network that performs NLDR transformations to satisfy LGP constraints.
result Improves consistencies in data interpretation through end-to-end task execution.

Often the challenge associated with tasks like fraud and spam detection[1] is the lack of all likely patterns needed to train suitable supervised learning models. In order to overcome this limitation, such tasks are attempted as outlier or anomaly detection tasks. We also hypothesize that out- liers have behavioral pat…

2017-12-12abs ↗pdf ↗

Consistent estimator derived for confounding strength in observational data.

problem Estimating confounding strength in observational data is challenging due to unobserved confounders.
method Derived and adapted a consistent estimator using tools from random matrix theory.
result The original estimator is not consistent, but an adapted one is.

New method interpolates training data and is consistent for various data distributions.

problem Establishing generalization guarantees for ensemble methods in the interpolating regime.
method Developed manifold-Hilbert kernel for Riemannian manifolds and used it in ensemble classification.
result Consistent ensemble classification method for broad data distributions.

Paper proposes SLINK clustering for nonparametric data sequences with improved consistency.

problem Nonparametric clustering of data sequences from unknown distributions.
method Exponentially consistent nonparametric SLINK clustering algorithm.
result SLINK clustering achieves exponential consistency under less strict conditions.

Kernel ridge regression imputation with consistent variance estimation for handling missing data.

problem Handling missing data in statistical analysis.
method Kernel ridge regression imputation combined with entropy method for variance estimation.
result Root-n consistency of the imputation estimator in a Sobolev space setting.

Improved inverse problem solving with data consistency in diffusion models.

problem Speed and data consistency issues in diffusion model-based inverse problems.
method Data Consistent Direct Diffusion Bridges (CDDB) that ensures data consistency without fine-tuning.
result CDDB outperforms inconsistent DDB in perception and distortion metrics.

New algorithms improve community detection in network data with strong consistency.

problem Challenges in effectively adapting spectral clustering techniques and achieving strong consistency in label recovery.
method Proposed Thresholded Cosine Spectral Clustering (TCSC) and one-step Refined TCSC algorithms, with strong consistency proofs.
result One-step Refined TCSC achieves strong consistency in community detection under PABM, correctly recovering all labels with high probability.

New framework improves generative models with prediction and consistency constraints.

problem Improving generative models with sparse labeled data.
method Optimizes variational autoencoders with prediction and consistency constraints.
result Promising image classification performance, especially in semi-supervised scenarios.

A new learning rule consistently reduces error over data samples.

problem Finding a learning rule that consistently reduces error over all data distributions.
method A deterministic, data-dependent partitioning rule that only partitions cyclic intervals with sufficient empirical diversity of labels.
result The expected error is monotone non-increasing with the sample size under every data distribution.

ε-Consistent Mixup improves semi-supervised classification accuracy.

problem Improving semi-supervised classification accuracy with limited labeled data.
method Combines Mixup's linear interpolation with consistency regularization, using an adaptive tradeoff between the two.
result ε-Consistent Mixup yields the largest gains in low label-availability scenarios.

Improved VAEs learn consistent posterior distributions from missing data.

problem Learning VAEs from data with missing values, especially in the encoder.
method Formal definition of posterior consistency and regularization approach.
result Regularization leads to improved performance in reconstruction and downstream tasks.

If pricing kernels are assumed non-negative then the inverse problem of finding the pricing kernel is well-posed. The constrained least squares method provides a consistent estimate of the pricing kernel. When the data are limited, a new method is suggested: relaxed maximization of the relative entropy. This estimator …

2003-10-15abs ↗pdf ↗

The paper examines the consistency of Lasso regression applied to signature analysis of time series data.

problem Consistency of Lasso regression in signature analysis of time series data.
method The paper studies the consistency of Lasso regression applied to signature analysis of time series data, both theoretically and numerically.
result The Lasso regression is consistent both asymptotically and in finite sample for certain types of time series and processes.

Chronologically consistent models maintain accuracy with time-restricted data.

problem Training data introduces lookahead bias and training leakage in large language models.
method ChronoBERT and ChronoGPT trained with only available data at each time point.
result Models achieve strong performance and competitive with larger models, mitigating lookahead bias.

PINNs struggle with data-to-PDE inconsistencies, limiting their accuracy.

problem Data inconsistency in PINNs affects their accuracy and convergence.
method Systematic analysis of PINNs with varying data fidelity and residual errors.
result PINNs saturate at an error level dictated by data inconsistency.

Physics-consistent method improves seismic inversion accuracy.

problem Challenges in seismic full-waveform inversion (FWI) due to ill-posedness and high cost.
method Hybrid approach combining physics-based models with data-driven methodologies, incorporating physics into data augmentation.
result Physics-consistent data-driven inversion yields higher accuracy and better generalization.

The problem of clustering is considered, for the case when each data point is a sample generated by a stationary ergodic process. We propose a very natural asymptotic notion of consistency, and show that simple consistent algorithms exist, under most general non-parametric assumptions. The notion of consistency is as f…

2010-05-05abs ↗pdf ↗

The problem of clustering is considered, for the case when each data point is a sample generated by a stationary ergodic process. We propose a very natural asymptotic notion of consistency, and show that simple consistent algorithms exist, under most general non-parametric assumptions. The notion of consistency is as f…

2010-04-29abs ↗pdf ↗

This paper establishes the asymptotic consistency of the {\it loss-calibrated variational Bayes} (LCVB) method. LCVB was proposed in~\cite{LaSiGh2011} as a method for approximately computing Bayesian posteriors in a `loss aware' manner. This methodology is also highly relevant in general data-driven decision-making con…

2019-11-04abs ↗pdf ↗

Study on Dirichlet process mixtures for clustering consistency.

problem Consistency of clustering with Dirichlet process mixtures.
method Analysis of posterior distribution as sample size increases, focusing on consistency for the number of clusters.
result Consistency for the number of clusters can be achieved with a properly adapted concentration parameter in a Bayesian setting.

In scientific inference problems, the underlying statistical modeling assumptions have a crucial impact on the end results. There exist, however, only a few automatic means for validating these fundamental modelling assumptions. The contribution in this paper is a general criterion to evaluate the consistency of a set …

2018-08-17abs ↗pdf ↗

FMM fails to accurately determine the number of components even with consistent posterior.

problem Determining the number of subpopulations in a data set using FMM.
method Analysis of FMM component-count posterior under model misspecification.
result FMM component-count posterior diverges under model misspecification, contrary to intuition.

A new method for weakly supervised learning that improves model accuracy.

problem Training machine learning models with precise labels is expensive; weak supervision provides a low-cost alternative.
method Data consistent weak supervision algorithm that searches over classifiers to find plausible labelings, considering features of the training data and estimating labels for low/no coverage data.
result Empirically, the method significantly outperforms state-of-the-art weak supervision methods on text and image classification tasks.

Aggregation distorts causal discovery results but recovery is possible with partial linearity or prior.

problem Understanding how temporal aggregation affects causal discovery in aggregated data.
method Functional consistency and conditional independence consistency methods.
result Causal discovery results may be distorted by aggregation, but recovery is possible with certain conditions.

SAEs struggle with feature consistency across runs, hindering MI reliability.

problem Inconsistency of learned SAE features across different training runs.
method Propose using the Pairwise Dictionary Mean Correlation Coefficient (PW-MCC) to measure feature consistency.
result High levels of feature consistency (0.80 for TopK SAEs on LLM activations) are achievable with appropriate architectural choices.

Stable and consistent model alignment for language models without assuming human preference models.

problem Lack of statistical consistency in existing alignment methods.
method Relative density ratio optimization between preferred and mixture of preferred and non-preferred data distributions.
result Our approach achieves statistical consistency and stability, providing tighter convergence guarantees.

The paper proposes methods for predicting missing values in mixed data matrices.

problem Matrix completion for mixed data types (continuous, binary, ordinal).
method Generalized latent factor models for low-rank matrix estimation with entrywise consistency.
result Tight probabilistic error bounds for the proposed estimators.

The cellular tree classifier model addresses a fundamental problem in the design of classifiers for a parallel or distributed computing world: Given a data set, is it sufficient to apply a majority rule for classification, or shall one split the data into two or more parts and send each part to a potentially different …

2013-01-20abs ↗pdf ↗

EnScale learns to downscale climate models efficiently, capturing both spatial and temporal consistency.

problem Downscaling climate models from coarse to high-resolution data is computationally expensive and challenging.
method EnScale uses generative models and proper scoring rules to map GCM data to RCM data, reducing computational cost.
result EnScale achieves competitive performance and computational efficiency in downscaling multiple climate variables.

Develops intrinsic Gaussian process regression for manifold-valued data.

problem Lack of intrinsic Gaussian process methods for manifold-valued response variables.
method Proposes an intrinsic covariance structure and a novel intrinsic Gaussian process regression model.
result Establishes asymptotic properties and shows posterior consistency.