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

2955908851,180 · Jun 202019922001200920172026
48 results for Consistency-Based Methods

The study analyzes consistency-based SSL methods and proposes a new framework.

problem Improving performance in semi-supervised learning with minimal labeled data.
method Analysis of consistency-based SSL methods, including the ΠΠ-model, and proposing a new framework.
result A simple extension of the Hidden Manifold Model that incorporates data-augmentation schemes.

Beam search improves UQ in LLMs by reducing duplicates and variance.

problem Peaked distributions in multinomial sampling lead to duplicates and high variance in uncertainty estimates.
method Employ beam search to generate candidates for consistency-based UQ, providing a theoretical lower bound and empirical evaluation.
result Beam search achieves smaller error than multinomial sampling, leading to state-of-the-art UQ performance.

LC-GNN improves GNNs for node classification by incorporating label consistency.

problem Limited performance of GNNs due to label consistency assumption not always holding.
method LC-GNN uses node pairs with the same label but unconnected to expand GNN's receptive field.
result LC-GNN outperforms traditional GNNs in semi-supervised node classification.

Proposes a new method to improve target annotation in ATR.

problem Challenges in annotating automatic target recognition due to lack of labeled data.
method Hybrid contrastive learning and cycle-consistency-based transductive transfer learning (C3TTL) framework.
result Significantly lower Fréchet Inception Distance (FID) score and improved performance in annotating civilian and military vehicles, as well as ship targets.

We consider the learning from noisy labels (NL) problem which emerges in many real-world applications. In addition to the widely-studied synthetic noise in the NL literature, we also consider the pseudo labels in semi-supervised learning (Semi-SL) as a special case of NL. For both types of noise, we argue that the gene…

2019-05-23abs ↗pdf ↗

Combines multiple asset views with machine learning for better portfolio allocation.

problem Portfolio allocation with multiple uncertain asset views.
method Consistency-based data fusion techniques for combining Black-Litterman model with machine learning predictions.
result Improved portfolio allocation through fusion of multiple view estimates.

SoQal uses selective oracle questioning to improve active learning of cardiac signals.

problem Active learning of cardiac signals is challenging due to limited labelled data and high annotation costs.
method Proposes a framework combining selective oracle questioning and Bayesian active learning by consistency.
result SoQal outperforms baseline methods in active learning of cardiac signals, even with noisy oracles.

Proposes a meta-learning algorithm to improve semi-supervised learning.

problem Overfitting and limited model generalization in consistency-based semi-supervised learning.
method Introduces a learn-to-generalize regularization term and meta-gradient optimization.
result Demonstrates improved performance on various datasets compared to state-of-the-art methods.

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.

DAPS++ improves diffusion-based image restoration by decoupling prior and likelihood.

problem Decoupling prior and likelihood in diffusion-based inverse problems.
method Introducing DAPS++, which fully decouples diffusion-based initialization from likelihood-driven refinement.
result Achieves high computational efficiency and robust reconstruction performance.

Contrastive regularization improves semi-supervised learning by better propagating confident pseudo-labels.

problem Consistency regularization's limitation in high performance and efficiency.
method Proposes contrastive regularization to update model features, pushing confident labels into unlabeled samples.
result Improves semi-supervised learning tasks with fewer training iterations and robust performance.

DAPS++ improves diffusion-based image restoration by decoupling prior and likelihood.

problem Decoupling prior and likelihood in diffusion-based inverse problems for better performance.
method Introducing DAPS++, which separates diffusion initialization from likelihood refinement.
result DAPS++ achieves high computational efficiency and robust reconstruction performance.

The top-kk error is often employed to evaluate performance for challenging classification tasks in computer vision as it is designed to compensate for ambiguity in ground truth labels. This practical success motivates our theoretical analysis of consistent top-kk classification. Surprisingly, it is not rigorously und…

2019-01-30abs ↗pdf ↗

Foundation models improve wage gap decomposition by capturing omitted career history factors.

problem Estimating wage disparities using incomplete career history data.
method Fine-tuning foundation models to mitigate omitted variable bias and estimate wage gaps.
result Foundation models can decompose gender wage gaps more accurately than traditional econometric methods.

We describe a novel optimization method for finite sums (such as empirical risk minimization problems) building on the recently introduced SAGA method. Our method achieves an accelerated convergence rate on strongly convex smooth problems. Our method has only one parameter (a step size), and is radically simpler than o…

2016-02-08abs ↗pdf ↗

A new method combines Laplace and Variational Bayes for scalable inference.

problem Complex models and large datasets make exact inference infeasible.
method Low-Rank Variational Bayes Correction (VBC) using Laplace method and Variational Bayes correction in a lower dimension.
result The method ensures scalability in both model complexity and data size.

In this paper, the author considers the numerical computation of CVA for large systems by Mote Carlo methods. He introduces two types of stochastic mesh methods for the computations of CVA. In the first method, stochastic mesh method is used to obtain the future value of the derivative contracts. In the second method, …

2015-10-15abs ↗pdf ↗

A comprehensive benchmark of 15 scRNA-seq imputation methods across various datasets and analyses.

problem Imputation of single-cell RNA sequencing data to recover latent transcriptional signals.
method Evaluation of 15 imputation methods across 30 datasets and 6 downstream analyses.
result Traditional methods generally outperform DL-based methods in scRNA-seq data analysis.

Proposes UTC method for stock price prediction with uncertainty quantification.

problem Lack of uncertainty estimates in stock prediction methods.
method Combines TC method with probabilistic modeling for point and uncertainty predictions.
result UTC method achieves higher returns and lower risks than baselines.

Survey of spectral, probabilistic, and deep metric learning methods.

problem Developing effective distance metrics for various machine learning tasks.
method Divided into spectral, probabilistic, and deep approaches, covering various techniques and their applications.
result Comprehensive overview of metric learning methods, including new developments and applications.

A novel weighted feature selection method using fuzzy sets improves classification accuracy and stability.

problem Improving feature selection accuracy and stability in machine learning models.
method Combination of four feature selection methods using fuzzy sets and bootstrap.
result Our method achieved significantly higher stability than individual methods.

Spectral methods of moments provide a powerful tool for learning the parameters of latent variable models. Despite their theoretical appeal, the applicability of these methods to real data is still limited due to a lack of robustness to model misspecification. In this paper we present a hierarchical approach to methods…

2018-10-17abs ↗pdf ↗

We propose an optimization method for minimizing the finite sums of smooth convex functions. Our method incorporates an accelerated gradient descent (AGD) and a stochastic variance reduction gradient (SVRG) in a mini-batch setting. Unlike SVRG, our method can be directly applied to non-strongly and strongly convex prob…

2015-06-09abs ↗pdf ↗

We discuss the relevance of the recent Machine Learning (ML) literature for economics and econometrics. First we discuss the differences in goals, methods and settings between the ML literature and the traditional econometrics and statistics literatures. Then we discuss some specific methods from the machine learning l…

2019-03-24abs ↗pdf ↗

We generalize Newton-type methods for minimizing smooth functions to handle a sum of two convex functions: a smooth function and a nonsmooth function with a simple proximal mapping. We show that the resulting proximal Newton-type methods inherit the desirable convergence behavior of Newton-type methods for minimizing s…

2012-06-07abs ↗pdf ↗