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

19385776 · May 202619922001200920172026
48 results for voter concentration

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.

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.

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.

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.

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 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 ↗

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 ↗

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 ↗

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.

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.

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.

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.

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.

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 ↗

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.

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 ↗

Paper addresses concentration of distances for fractional quasi p-norms, identifying conditions for concentration and anti-concentration.

problem Understanding concentration of distances for fractional quasi p-norms in high dimensions.
method Analyzes conditions for concentration and anti-concentration of distances for fractional quasi p-norms.
result Identifies conditions for concentration and anti-concentration of fractional quasi p-norms, ruling out some approaches and specifying conditions for control.

Study Finsler metric measure manifolds' concentration properties.

problem Understanding concentration properties in Finsler metric measure manifolds.
method Established relationships with observable diameter, isoperimetric inequalities, and first eigenvalue.
result Derived a Cheng type upper bound estimate for the first closed eigenvalue.

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 ↗

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 survey recent results related to the concentration of eigenfunctions. We also prove some new results concerning ball-concentration, as well as showing that eigenfunctions saturating lower bounds for L1L^1-norms must also, in a measure theoretical sense, have extreme concentration near a geodesic.

2015-10-26abs ↗pdf ↗

Study on volume of tubes and concentration in Riemannian geometry.

problem Understanding concentration loci in Riemannian manifolds and their relation to tube volumes.
method Provided a general formula for tube volumes, specialized to totally geodesic submanifolds, and investigated concentration loci.
result Explicitly proved concentration for codimension one cases and explored characterizations in Wasserstein and Box distances.