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

3517021,0521,403 · Jun 202019922001200920172026
48 results for voter model

Analyzed a generalized voter model with power-law herding intensity, revealing anomalous diffusion and long-range memory.

problem Anomalous diffusion and long-range memory in a generalized voter model.
method Derived analytical expressions for moments and first passage time distribution, confirmed numerically.
result The model exhibits long-range memory indicators despite being a Markov model.

Optimal number of voters for a voting ensemble can be estimated from the distribution of classifier errors.

problem Finding the optimal number of voters for a voting ensemble to minimize error rate.
method Estimate the distribution of classifier errors and infer error rates for different numbers of voters.
result Lower-variance estimates of error rates can be obtained by inferring them for different numbers of voters.

This paper analyzes voter coalitions in MakerDAO's decentralized governance.

problem Understanding the governance structure and influence of voter coalitions in DAOs.
method Applied clustering algorithm to voting history of MakerDAO to identify voter coalitions.
result The emergence of a dominant voter coalition signals governance centralization in DAOs.

The paper proposes methods to identify and sample from mixtures of Mallows models for top-k rankings.

problem Identifying and sampling from mixtures of Mallows models for top-k rankings in a heterogeneous population.
method Efficient sampling algorithms and identifiability proofs for both components of the mixture.
result The identifiability and learnability of the Mallows components' parameters in the mixture.

We present a new modeling technique for solving the problem of ecological inference, in which individual-level associations are inferred from labeled data available only at the aggregate level. We model aggregate count data as arising from the Poisson binomial, the distribution of the sum of independent but not identic…

2018-02-04abs ↗pdf ↗

We consider a problem of ecological inference, in which individual-level covariates are known, but labeled data is available only at the aggregate level. The intended application is modeling voter preferences in elections. In Rosenman and Viswanathan (2018), we proposed modeling individual voter probabilities via a log…

2019-07-21abs ↗pdf ↗

New bounds on majority voting's accuracy for multi-class classification problems.

problem Determining the accuracy of majority voting for multi-class classification.
method Analyzing the majority voting function under different voter conditions and distributions.
result The error rate of majority voting exponentially decays or grows with the number of voters under certain conditions.

We propose a new analytical method to study stochastic, binary-state models on complex networks. Moving beyond the usual mean-field theories, this alternative approach is based on the introduction of an annealed approximation for uncorrelated networks, allowing to deal with the network structure as parametric heterogen…

2016-02-22abs ↗pdf ↗

In the spirit of behavioral finance, we study the process of opinion formation among investors using a variant of the 2D Voter Model with a tunable social temperature. Further, a feedback acting on the temperature is introduced, such that social temperature reacts to market imbalances and thus becomes time dependent. I…

2012-12-19abs ↗pdf ↗

In the past few years, a lot of attention has been devoted to multimedia indexing by fusing multimodal informations. Two kinds of fusion schemes are generally considered: The early fusion and the late fusion. We focus on late classifier fusion, where one combines the scores of each modality at the decision level. To ta…

2014-04-30abs ↗pdf ↗

Proposes a Latent Block Model for analyzing missing data.

problem Missing data can lead to misleading conclusions if not properly accounted for.
method Co-clustering model based on Latent Block Model, with variational EM algorithm for inference and model selection criterion.
result The proposed model reveals meaningful groups and insights from non-voters in French Parliament voting records.

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.

Study shows social reinforcement learning can lead to persistent but metastable polarization.

problem Understanding the persistence and dynamics of opinion polarization.
method Simulation and mathematical analysis of a reinforcement learning model of opinion dynamics.
result Polarization observed in the model is metastable and will eventually lead to consensus.

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.

A lot of attention has been devoted to multimedia indexing over the past few years. In the literature, we often consider two kinds of fusion schemes: The early fusion and the late fusion. In this paper we focus on late classifier fusion, where one combines the scores of each modality at the decision level. To tackle th…

2012-07-04abs ↗pdf ↗

cMCA uses contrastive learning to identify latent subgroups in political party data.

problem Identifying latent subgroups within political party data.
method Contrastive learning applied to multiple correspondence analysis (MCA).
result cMCA identifies latent subgroups not seen by traditional methods.

We study the issue of PAC-Bayesian domain adaptation: We want to learn, from a source domain, a majority vote model dedicated to a target one. Our theoretical contribution brings a new perspective by deriving an upper-bound on the target risk where the distributions' divergence---expressed as a ratio---controls the tra…

2015-06-15abs ↗pdf ↗

We develop new algorithms for estimating heterogeneous treatment effects, combining recent developments in transfer learning for neural networks with insights from the causal inference literature. By taking advantage of transfer learning, we are able to efficiently use different data sources that are related to the sam…

2018-08-23abs ↗pdf ↗

In the Network Inference problem, one seeks to recover the edges of an unknown graph from the observations of cascades propagating over this graph. In this paper, we approach this problem from the sparse recovery perspective. We introduce a general model of cascades, including the voter model and the independent cascad…

2015-05-21abs ↗pdf ↗

Improved surname geocoding and name supplements enhance race imputation accuracy.

problem Census data problems affecting race imputation accuracy.
method Fully Bayesian Improved Surname Geocoding (fBISG) and name supplements.
result Significant improvement in race imputation accuracy across all racial groups.

New algorithms minimize PAC-Bayesian C-Bound for majority voting, leading to scalable and accurate predictors.

problem Improving majority vote classifiers using PAC-Bayesian bounds.
method Directly optimizing PAC-Bayesian guarantees on the C-Bound with gradient descent.
result Self-bounding majority vote learning algorithms with scalable and accurate predictors.

We provide two main contributions in PAC-Bayesian theory for domain adaptation where the objective is to learn, from a source distribution, a well-performing majority vote on a different, but related, target distribution. Firstly, we propose an improvement of the previous approach we proposed in Germain et al. (2013), …

2017-07-17abs ↗pdf ↗

Social media systems rely on user feedback and rating mechanisms for personalization, ranking, and content filtering. However, when users evaluate content contributed by fellow users (e.g., by liking a post or voting on a comment), these evaluations create complex social feedback effects. This paper investigates how ra…

2014-05-06abs ↗pdf ↗

New voting strategies show committee-based consensus can scale efficiently.

problem Ensuring honest committees in committee-based consensus protocols.
method Empirical analysis of simpler voting strategies and their convergence to optimality.
result Simpler voting strategies converge to optimality exponentially quickly, ensuring robustness and efficiency.

Prediction markets can shape political behavior through persistent signals, not just forecast accuracy.

problem The role of prediction markets beyond forecasting.
method Transaction-level evidence from the 2024 U.S. presidential election, Signal Credibility Index (SCI).
result Price signals in prediction markets are more influential due to persistence, breadth of trader types, and cross-platform consensus.

The paper introduces BCART models for aggregate claim amount, improving frequency-severity and joint modeling.

problem Modeling aggregate claim amount with frequency-severity and joint dependencies.
method Developed three types of BCART models: frequency-severity, sequential, and joint models. Used various distributions for claim severity data.
result Weibull distribution outperforms gamma and lognormal for right-skewed, heavy-tailed claim severity data.

The paper uses model-based trees to create interpretable surrogate models for complex machine learning models.

problem Interpreting complex machine learning models.
method Using model-based trees to partition feature space and create interpretable models.
result Model-based trees generate optimal surrogate models that balance interpretability and performance.

The study examines how model predictions hold up under model extensions.

problem Model predictions may not be robust under model extensions, limiting their applicability.
method The study uses causal ordering to assess robustness of qualitative model predictions and characterizes model extensions that preserve predictions.
result Conditions and techniques are provided to assess robustness of model predictions under model extensions.

Revises Bayesian model averaging for foundation models.

problem Ensemble pre-trained and lightly-finetuned foundation models for improved classification performance.
method Introduces trainable linear classifiers and computationally cheaper model averaging scheme (OMA).
result Ensembled models can better predict on various datasets.