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

Trend · papers per month

36811 · Sep 202019922001200920172026
48 results for Pseudo-label Election

Geometric Graph Alignment enhances IoT intrusion detection using NID data.

problem Data scarcity hinders IoT intrusion detection accuracy.
method Geometric Graph Alignment (GGA) approach to transfer knowledge between network intrusion detection and IoT intrusion detection domains.
result GGA approach boosts IoT intrusion detection performance on multiple datasets.

Complex dynamical systems driven by the unravelling of information can be modelled effectively by treating the underlying flow of information as the model input. Complicated dynamical behaviour of the system is then derived as an output. Such an information-based approach is in sharp contrast to the conventional mathem…

2019-04-21abs ↗pdf ↗

Human stablecoin transactions predict political risk in cryptocurrency markets.

problem Predicting political risk in cryptocurrency markets.
method Structural break analysis and surrogate-based robustness tests.
result Human-driven stablecoin transactions shift significantly before major political events.

This paper examines how voter concentration affects election outcomes in district-based systems.

problem How does the spatial concentration of electors impact election results?
method The authors frame the spatial distribution of electors in a probabilistic setting and explore models to capture intra-district polarization. They use Likelihood-free Inference under the Approximate Bayesian Computation framework and supervised regression methods to estimate parameters.
result The models can capture statistical properties of real elections and show how voter distributions can change election results.

Taleb (2018) claimed a novel approach to evaluating the quality of probabilistic election forecasts via no-arbitrage pricing techniques and argued that popular forecasts of the 2016 U.S. Presidential election had violated arbitrage boundaries. We show that under mild assumptions all such political forecasts are arbitra…

2019-07-02abs ↗pdf ↗

Fuzzy Forests reduces feature space in high-dimensional survey data.

problem High-dimensional and highly correlated datasets in social science.
method Fuzzy Forests algorithm, a variant of Random Forests.
result Partisan polarization was the strongest factor in the 2020 presidential election.

Calculates winning probability for three candidates based on support rates and information timing.

problem Determining optimal strategy for three candidates in an election.
method Closed-form solution using support rates, political spectrum positioning, time left, and information revelation rate.
result Optimal strategy can be complex, especially for candidates in the center of a polarized electorate.

Doubly robust self-training improves semi-supervised learning by balancing labeled and pseudo-labeled data.

problem Improving semi-supervised learning performance with limited labeled data.
method Introduces doubly robust self-training, a method that combines labeled and pseudo-labeled data to balance between labeled-only and pseudo-labeled-only training.
result Demonstrates superior performance of doubly robust self-training on ImageNet and nuScenes datasets.

Most recent semi-supervised deep learning (deep SSL) methods used a similar paradigm: use network predictions to update pseudo-labels and use pseudo-labels to update network parameters iteratively. However, they lack theoretical support and cannot explain why predictions are good candidates for pseudo-labels. In this p…

2019-08-09abs ↗pdf ↗

Proposes a transfer learning framework to improve U.S. election prediction models.

problem Limited spatial data and spatial dependence challenges in presidential election prediction.
method Proposes a novel transfer learning framework within the SAR model, using a two-stage algorithm with transferring and debiasing stages.
result Substantially improves prediction accuracy and outperforms traditional methods in U.S. presidential swing states.

Solves biased pseudo-labels in imbalanced SSL by refining them.

problem Imbalanced class distributions in semi-supervised learning lead to biased pseudo-labels.
method Formulates a convex optimization problem to refine pseudo-labels and develops an efficient algorithm, DARP.
result Demonstrates the effectiveness of DARP in various imbalanced semi-supervised scenarios.

In accordance with "Democracy's Effect on Development: More Questions than Answers", we seek to carry out a study in following the description in the 'Questions for Further Study.' To that end, we studied 33 countries in the Sub-Saharan Africa region, who all went through an election which should signal a "step-up" for…

2017-12-12abs ↗pdf ↗

Paper improves short text clustering by integrating semantic relationships into Optimal Transport.

problem Erroneous pseudo-labels caused by neglecting semantic consistency in existing OT methods.
method Designs an instance-level attention mechanism to capture semantic relationships and integrates them into the OT formulation.
result Generates reliable pseudo-labels that improve clustering accuracy.

In this paper, we explore the detection of clusters of stocks that are in synergy in the Indian Stock Market and understand their behaviour in different circumstances. We have based our study on high frequency data for the year 2014. This was a year when general elections were held in India, keeping this in mind our da…

2019-02-20abs ↗pdf ↗

New method removes pseudo-label bias for unsupervised domain adaptation.

problem Class imbalance and distribution shift between domains.
method Implicit class-conditioned domain alignment without explicit pseudo-label optimization.
result Effective in handling within-domain class imbalance and between-domain class distribution shift.

The paper improves self-training in semi-supervised learning by selecting more robust pseudo-labeled data.

problem Improving the reliability of pseudo-labeled data selection in self-training for semi-supervised learning.
method Proposes a multi-objective utility function to select pseudo-labeled data that maximizes reliability, considering model selection, accumulation of errors, and covariate shift uncertainties.
result Robustness towards model choice can lead to substantial accuracy gains in self-training.

A new SSL method uses instance-dependent thresholds to improve accuracy.

problem Improving semi-supervised learning by better selecting confident unlabeled instances.
method Proposes instance-dependent thresholds that vary based on the ambiguity and error rates of pseudo-labels for each unlabeled instance.
result Demonstrates that instance-dependent thresholds provide a probabilistic guarantee for correct pseudo-labels.

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.

Pseudo-label selection affects semi-supervised learning performance.

problem Selection of pseudo-labeled data impacts semi-supervised learning's generalization performance.
method Embedding pseudo-label selection into decision theory, deriving a novel selection criterion based on posterior predictive.
result BPLS (Bayesian pseudo-label selection) outperforms traditional methods in overfitting-prone data.

The paper uses Black-Scholes model to analyze political support and coalition agreements.

problem Determining the minimum support level for a minor party in a pre-electoral coalition.
method Modeling political support as a stochastic process with a deterministic growth rate and applying Black-Scholes option pricing theory.
result The minimum support level for a minor party to gain a representative in a pre-electoral coalition.

POTA improves short text clustering by generating reliable pseudo-labels.

problem Limited discriminative representations in short texts.
method POTA uses instance-level attention and optimal transport for semantic consistency and cluster structure.
result POTA outperforms state-of-the-art methods in short text clustering.

MTL method uses unlabeled data with pseudo labels to improve classification with disjoint datasets.

problem Improving classification performance with disjoint labeled datasets using unlabeled data.
method Proposes MTL-SA method to select and augment unlabeled data with confident pseudo labels and close distribution to labeled data.
result Extensive experiments show the effectiveness of MTL-SA method in improving classification performance.

A method for selecting pseudo-labeled data in semi-supervised learning using generalized Bayes and soft revision.

problem Selecting pseudo-labeled data for semi-supervised learning with robustness to uncertainty.
method Using credal sets and the Gamma-Maximin method with soft revision to update priors and select pseudo-labeled data.
result The Gamma-Maximin method with soft revision can achieve promising results, especially in scenarios with low labeled data proportions.

We consider the estimation of binary election outcomes as martingales and propose an arbitrage pricing when one continuously updates estimates. We argue that the estimator needs to be priced as a binary option as the arbitrage valuation minimizes the conventionally used Brier score for tracking the accuracy of probabil…

2017-03-18abs ↗pdf ↗

Framework for domain adaptation using pseudo-labels from unlabeled data.

problem Improving prediction accuracy in target domain with covariate shift.
method Kernel GLMs with labeled and pseudo-labeled data, using imputation model for target data.
result Non-asymptotic excess-risk bounds for effective labeled sample size.

Mitigates confirmation bias in SSL by adjusting pseudo labels dynamically.

problem Confirmation bias in semi-supervised learning leads to errors in pseudo labels.
method TaMatch framework adjusts scaling ratio to debias pseudo labels and dynamically adjusts target distribution.
result TaMatch significantly outperforms existing methods in SSL tasks.

This paper presents a data set describing the evolution of results in the Portuguese Parliamentary Elections of October 6th^{th} 2019. The data spans a time interval of 4 hours and 25 minutes, in intervals of 5 minutes, concerning the results of the 27 parties involved in the electoral event. The data set is tailored f…

2019-12-05abs ↗pdf ↗

The paper improves semi-supervised learning using ff-divergences and αα-Rényi divergences.

problem Improving semi-supervised learning with noisy pseudo-labels.
method Inspired by ff-divergences and αα-Rényi divergences, the paper develops new empirical risk functions and regularization techniques.
result The new methods show better performance than traditional self-training methods, especially in noisy pseudo-label scenarios.

GUST framework improves self-training by estimating node uncertainty and generating pseudo-labels.

problem Over-confidence in pseudo-labels during self-training.
method Graph-based uncertainty-aware self-training with stochastic node labeling.
result GUST achieves state-of-the-art performance, especially in sparse labeled data settings.

Proposes a new contrastive loss for semi-supervised medical image segmentation.

problem Lack of labeled data for medical image segmentation.
method Uses pseudo-labels and a local contrastive loss to learn good local representations.
result Achieved high segmentation performance on public cardiac and prostate datasets.