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

481216 · Jun 202619922001200920172026
48 results for Mallow's Cp

Cross-validation estimates model performance on unseen data, not training data.

problem Understanding how cross-validation estimates prediction error and its limitations.
method Analyzing linear models and popular prediction error estimates, introducing nested cross-validation.
result Cross-validation estimates the average prediction error of models fit on other unseen training sets, not the model at hand.

The Mallows model, introduced in the seminal paper of Mallows 1957, is one of the most fundamental ranking distribution over the symmetric group SmS_m. To analyze more complex ranking data, several studies considered the Generalized Mallows model defined by Fligner and Verducci 1986. Despite the significant research in…

2019-06-03abs ↗pdf ↗

The paper tackles learning true rankings from noisy, incomplete data.

problem Learning true rankings from incomplete and noisy data.
method Introduces a selective Mallows model for noisy rankings and derives upper and lower bounds on sample complexity.
result Strong asymptotically tight bounds on sample complexity for learning complete rankings and top-k rankings.

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 propose a novel parameterized family of Mixed Membership Mallows Models (M4) to account for variability in pairwise comparisons generated by a heterogeneous population of noisy and inconsistent users. M4 models individual preferences as a user-specific probabilistic mixture of shared latent Mallows components. Our k…

2015-04-03abs ↗pdf ↗

Mixtures of Mallows models are a popular generative model for ranking data coming from a heterogeneous population. They have a variety of applications including social choice, recommendation systems and natural language processing. Here we give the first polynomial time algorithm for provably learning the parameters of…

2018-08-17abs ↗pdf ↗

New algorithm learns permutations mixtures with optimal sample complexity.

problem Learning mixtures of permutations in high-dimensional settings.
method Combining groups of pairwise comparisons and combinatorial method of moments.
result Optimal sample complexity proportional to log(n) for high-dimensional data.

The paper addresses model averaging and ensembling, providing theoretical and practical insights.

problem Combining least squares estimators from multiple candidate models for improved predictive accuracy.
method Establishes oracle inequalities for Mallows' CpC_p criterion, proposes a novel Mallows-type MA procedure.
result Demonstrates the effectiveness of the proposed Mallows-type MA estimator through numerical experiments.

Paper proposes a new anomaly detection method using Random Forest with Mallows-like criterion.

problem Inherent uncertainty in model selection for anomaly detection.
method Integrates Mallows-like criterion into Random Forest algorithm for anomaly detection.
result Proposed method outperforms traditional methods in accuracy and robustness.

Permutation-valued features arise in a variety of applications, either in a direct way when preferences are elicited over a collection of items, or an indirect way in which numerical ratings are converted to a ranking. To date, there has been relatively limited study of regression, classification, and testing problems …

2016-03-25abs ↗pdf ↗

We analyze the generalized Mallows model, a popular exponential model over rankings. Estimating the central (or consensus) ranking from data is NP-hard. We obtain the following new results: (1) We show that search methods can estimate both the central ranking pi0 and the model parameters theta exactly. The search is n!…

2012-06-20abs ↗pdf ↗

We introduce a new family of minmax rank aggregation problems under two distance measures, the Kendall τ and the Spearman footrule. As the problems are NP-hard, we proceed to describe a number of constant-approximation algorithms for solving them. We conclude with illustrative applications of the aggregation methods on…

2017-01-28abs ↗pdf ↗

We prove that the connected sums CP_2 # CP_2 and CP_2 # CP_2 # CP_2 admit self-dual metrics with positive Ricci curvature. Moreover, every self-dual metric of positive scalar curvature on CP_2 # CP_2 is conformal to a metric with positive Ricci curvature.

1994-11-04abs ↗pdf ↗

Extends Fisher's Discriminant Analysis for interval-valued data.

problem Classifying entities represented by intervals and histograms.
method Adapts Fisher's Discriminant Analysis using Moore's interval arithmetic and Mallows' distance.
result Discriminant directions for interval-valued data are numerically maximized.

This paper presents a natural extension of stagewise ranking to the the case of infinitely many items. We introduce the infinite generalized Mallows model (IGM), describe its properties and give procedures to estimate it from data. For estimation of multimodal distributions we introduce the Exponential-Blurring-Mean-Sh…

2012-06-13abs ↗pdf ↗

The paper explores the genus of surfaces in complex projective spaces and improves minimal genus bounds.

problem Investigating the genus of surfaces in complex projective spaces.
method Analyzing knots and torus knots in CP2\mathbb{CP}^2 and CP2#CP2\mathbb{CP}^2\# \mathbb{CP}^2.
result The CP2\mathbb{CP}^2-genus of knots is unbounded, unlike its topological counterpart.

The paper applies communication theory to improve language model reranking.

problem Ensuring safety and accuracy in language model outputs.
method Drawing parallels between communication theory and language model reranking, the authors propose a protocol to improve reliability.
result The proposed protocol can achieve asymptotically error-free performance in noisy communication scenarios.

The set of maximal non-integrable structures (SU(2)×SU(2),B,I)(SU(2)\times SU(2),B,I), where BB is Killing-Cartan metric is described as subset of CP3\mathbb{CP}^3. The visualization of complex projective space CP3\mathbb{CP}^3 as tetrahedron which edges and faces are CP1\mathbb{CP}^1 and CP2\mathbb{CP}^2 is used.

2006-08-29abs ↗pdf ↗

In 1983, Banchoff and Kuhnel constructed a minimal triangulation of $\CP^2$ with 9 vertices. $\CP^3$ was first triangulated by Bagchi and Datta in 2012 with 18 vertices. Known lower bound on number of vertices of a triangulation of $\CP^n$ is 1+(n+1)221 + \frac{(n + 1)^2}{2} for n3n \geq 3. We give explicit construction of so…

2014-05-11abs ↗pdf ↗

Page's Einstein metric on CP_2 # (-CP_2) is conformally related to an extremal Kaehler metric. Here we construct a family of conformally Kähler solutions of the Einstein-Maxwell equations that deforms the Page metric, while sweeping out the entire Kaehler cone of CP_2 # (-CP_2).The same method also yields analogous sol…

2015-04-24abs ↗pdf ↗

We construct potentially new manifolds homeomorphic but not diffeomorphic to CP2#8CP2\mathbb{CP}^{2} \# 8 \overline{\mathbb{CP}^{2}} and CP2#9CP2\mathbb{CP}^{2} \# 9 \overline{\mathbb{CP}^{2}} via rational blowdown surgery along certain 44-valent plumbing graphs. This way all the graph classes from \cite{weighted} have a represen…

2019-04-29abs ↗pdf ↗

We explicitly construct genus-2 Lefschetz fibrations whose total spaces are minimal symplectic 4-manifolds homeomorphic to complex rational surfaces CP^2 # p (-CP^2) for p=7, 8, 9, and to 3 CP^2 #q (-CP^2) for q =12,...,19. Complementarily, we prove that there are no minimal genus-2 Lefschetz fibrations whose total spa…

2015-10-01abs ↗pdf ↗

Let MM be $\CP#2\CPb$, $3\CP#4\CPb$ or $(2n-1)\CP#2n\CPb$ for any integer n3n\geq 3. We construct an irreducible symplectic 4-manifold homeomorphic to MM and also an infinite family of pairwise non-diffeomorphic irreducible non-symplectic 4-manifolds homeomorphic to MM. We also construct such exotic smooth structure…

2007-01-29abs ↗pdf ↗

We use Hamiltonian actions to construct nonstandard (as opposed to $\RP^n$ and TnT^n) Lagrangian submanifolds of $\CP^n$. First of all, a quotient of $\RP^3$ by the dihedral group D3D_3 is a Lagrangian submanifold of $\CP^3$. Secondly, $\Su(n)/\Z_n$ are Lagrangian submanifolds of $\CP^{n^2-1}$.

2003-03-20abs ↗pdf ↗