New method for summarizing ranking distributions using consensus ranking distributions.
problem Summarizing ranking distributions efficiently and accurately.
method Introducing consensus ranking distributions and a top-down tree-structured statistical algorithm.
result Optimal distortion can be expressed as a function of pairwise probabilities, enabling efficient learning methods.
Estimates low-rank distributional matrices from incomplete samples.
problem Matrix completion for distributional entries with limited observed data.
method Kernel mean embeddings, Tucker rank, functional unfolding operators.
result Effective estimator for distributional matrix completion established.
Analytic proof for minimal rank Sard conjecture.
problem Proving the minimal rank Sard conjecture in the analytic category.
method Using subanalytic abnormal distribution from [4], we establish a proof.
result The set of points accessible through singular horizontal curves of minimal rank has Lebesgue measure zero.
New ranking system balances fairness and user utility.
problem Achieving group fairness in ranking systems.
method Formulated a minimax game between a ranking player and an adversary.
result Better utility for highly fair rankings.
Proves Sard conjecture for specific distributions, controlling divergence of vector fields.
problem Proving the Sard conjecture for certain types of distributions.
method Constructs a singular distribution capturing essential abnormal lifts, proving the conjecture for rank 3 distributions in dimension 4 and generic corank 1 distributions.
result Proves the Sard conjecture for generic co-rank one distributions.
Motivated by control-affine systems in optimal control theory, we introduce the notion of a point-affine distribution on a manifold X - i.e., an affine distribution F together with a distinguished vector field contained in F. We compute local invariants for point-affine distributions of constant type when dim(X)=n, ran…
A recommender system based on ranks is proposed, where an expert's ranking of a set of objects and a user's ranking of a subset of those objects are combined to make a prediction of the user's ranking of all objects. The rankings are assumed to be induced by latent continuous variables corresponding to the grades assig…
Distributions over rankings are used to model data in various settings such as preference analysis and political elections. The factorial size of the space of rankings, however, typically forces one to make structural assumptions, such as smoothness, sparsity, or probabilistic independence about these underlying distri…
Constructs canonical frames for specific distributions, proving maximality and describing germs.
problem Local geometry of rank 2 distributions with specific cube dimensions.
method Uniform construction of canonical absolute parallelism, iterative Cartan deprolongation.
result Automatic maximality condition holds at generic points, covering all cases.
Paper classifies structures on 5D manifolds with specific rank and conditions.
problem Classifying tangent distributions on 5D manifolds.
method Established necessary and sufficient topological condition for existence.
result Classification of structures up to homotopy as formal Cartan distributions.
Analytic torsion defined for rank 2 distributions on 5-manifolds.
problem Defining and analyzing analytic torsion for rank 2 distributions.
method Proposed an analytic torsion for Rumin complex associated with rank 2 distributions on 5-manifolds, established anomaly formulas, and showed coincidence with Ray-Singer torsion.
result The proposed torsion coincides with Ray-Singer torsion for certain nilmanifolds.
GANs improve missing data imputation for ranking tasks.
problem Missing data in ranking datasets violates standard assumptions.
method Conditional Imputation GAN for Extended Missing At Random and Extended Always Missing At Random mechanisms.
result Optimal GAN imputation for EMAR and EAMAR mechanisms.
This paper addresses the problem of rank aggregation, which aims to find a consensus ranking among multiple ranking inputs. Traditional rank aggregation methods are deterministic, and can be categorized into explicit and implicit methods depending on whether rank information is explicitly or implicitly utilized. Surpri…
New invariant real rank identifies constant real Lie algebroids.
problem Characterizing complex Lie algebroids with constant real rank.
method Introducing real rank and minimal complex subalgebroid.
result Local splitting and characterization of complex Lie algebroids.
In 1910 E. Cartan constructed the canonical frame and found the most symmetric case for maximally nonholonomic rank 2 distributions on a 5-dimensional manifold. We solve the analogous problems for rank 2 distributions on an n-dimensional manifold for arbitrary n greater than 5. Our method is a kind of symplectification…
Study the distribution for low-rank matrix learning, improving inference methods.
problem Lack of understanding of underlying probability distributions in low-rank matrix learning.
method Analyze the distribution f(X)∝e−λ∥X∥∗, using differential geometry to design an improved MCMC algorithm and learn penalty parameter λ. result Improved MCMC algorithm and penalty parameter learning for low-rank Bayesian inference.
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.
New insights into identifying mixtures of product distributions using Hadamard extensions.
problem Identifying mixtures of product distributions on binary variables.
method Analysis of Hadamard extensions of matrix products.
result Conditions for full column rank of Hadamard extensions.
Framework for optimizing search engine rankings using observational data.
problem Optimizing ranking policies for search engines using limited observational data.
method Formulated expected reward optimization problem, estimated context value distribution, trained ranking policy via Bayesian inference.
result Demonstrated trade-offs in ranking policies trained on empirical reward estimates.
Analytic torsion matches Ray-Singer for specific nilmanifolds.
problem Matching analytic torsion with Ray-Singer in specific nilmanifolds.
method Examined rank two distributions on 5D nilmanifolds, proving torsion equality.
result Analytic torsion equals Ray-Singer torsion in these specific nilmanifolds.
New ranking models for time series data using GARCH-type approach.
problem Handling time series of ranking data.
method Developed ranking GARCH models based on Mallows distribution and maximum likelihood estimation.
result The proposed models capture temporal dynamics of rankings effectively.
New algorithm for active bipartite ranking with continuous distributions.
problem Active ranking of bipartite data with continuous conditional distributions.
method Developed a novel algorithm called smooth-rank to minimize the distance between estimated and optimal ROC curves.
result Smooth-rank algorithm is PAC-(ε,δ) and outperforms existing methods in empirical tests. We study the convergence of a variant of distributed gradient descent (DGD) on a distributed low-rank matrix approximation problem wherein some optimization variables are used for consensus (as in classical DGD) and some optimization variables appear only locally at a single node in the network. We term the resulting a…
Efficiently reduces tensor ranks using mean-field approximation.
problem Low-rank approximation of non-negative tensors.
method Mean-field approximation of tensor rank reduction.
result Our algorithm achieves faster and competitive tensor rank reduction.
The paper uses belief propagation to analyze rankings and partial orders from partial information.
problem Analyzing rankings and partial orders from incomplete data.
method Continuous spin system and belief propagation algorithm.
result Computes marginal distribution and approximates number of linear extensions.
We consider the problem of learning over non-stationary ranking streams. The rankings can be interpreted as the preferences of a population and the non-stationarity means that the distribution of preferences changes over time. Our goal is to learn, in an online manner, the current distribution of rankings. The bottlene…
In 1910 E. Cartan constructed a canonical frame and found the most symmetric case for maximally nonholonomic rank 2 distributions in R5. We solve the analogous problem for germs of generic rank 2 distributions in Rn for n>5. We use a completely different approach based on the symplectification o…
Novel method for efficient low-rank matrix estimation and bandit algorithms.
problem Low-rank matrix estimation and bandit problems.
method LowPopArt method for low-rank matrix estimation and novel experimental design criterion.
result Improved recovery guarantees and regret bounds for low-rank bandit algorithms.
We consider the problem of learning a high-dimensional but low-rank matrix from a large-scale dataset distributed over several machines, where low-rankness is enforced by a convex trace norm constraint. We propose DFW-Trace, a distributed Frank-Wolfe algorithm which leverages the low-rank structure of its updates to ac…
Paper develops inference methods for low-rank tensors without debiasing.
problem Statistical inference for low-rank tensor models.
method Two-iteration alternating minimization for asymptotic distribution.
result Asymptotic distributions and confidence regions for singular subspaces.
We demonstrate how the novel approach to the local geometry of structures of nonholonomic nature, originated by Andrei Agrachev, works in the following two situations: rank 2 distributions of maximal class in R^n with non-zero generalized Wilczynski invariants and rank 2 distributions of maximal class in R^n with addit…
Characterizes metabelian distributions and geodesics in sub-Riemannian manifolds.
problem Characterizing metabelian distributions and geodesics in sub-Riemannian manifolds.
method Characterization of metabelian distributions in terms of principal bundle structures. Proof of geodesic properties for rank-2 distributions.
result For rank-2 metabelian distributions, geodesics are of class C1. In this paper we derive the maximum entropy characteristics of a particular rank order distribution, namely the discrete generalized beta distribution, which has recently been observed to be extremely useful in modelling many several rank-size distributions from different context in Arts and Sciences, as a two-paramete…
To certain types of generic distributions (subbundles in a tangent bundle) one can associate canonical Cartan connections. Many of these constructions fall into the class of parabolic geometries. The aim of this article is to show how strong restrictions on the possibles sizes of automorphism groups of such distributio…
Low-rank MPPCA improves importance sampling in high dimensions.
problem Estimating full-rank GMM covariance matrices in high dimensions is numerically unstable.
method Use MPPCA mixtures as low-rank proposals for importance sampling in high-dimensional spaces.
result Consistent gains in sample efficiency and quality of failure distribution characterization.
The paper reviews exchangeability and its implications for conformal prediction and rank tests.
problem Ensuring distribution-free predictive inference in machine learning and statistics.
method Explains exchangeability and its role in conformal prediction and rank tests.
result Discovers similarities between conformal prediction and rank tests based on exchangeability.
There are two different approaches to exhibit submaximal symmetric rank 2 distributions in 5D via Monge equations. In this note we establish precise relations between these models, find auto-equivalences of one family, and treat two special equations.
Study symplectification of rank 2 distributions and their connections.
problem Understanding symplectification and Cartan prolongations of rank 2 distributions.
method Using Tanaka-Morimoto theory and symplectification procedure for rank 2 distributions.
result Demonstrates the existence of normal Cartan connections and iterated prolongations for rank 2 distributions.
New gossip algorithms improve robustness of rank-based statistics in decentralized systems.
problem Ensuring robustness in decentralized AI and edge intelligence systems, especially in the presence of corrupted or adversarial data.
method Developed asynchronous gossip algorithms for computing rank-based statistics.
result First convergence rate bound for asynchronous gossip-based rank estimation.
New method reduces summary points for datasets while maintaining quality.
problem Thinning datasets to reduce summary points while maintaining quality.
method Low-rank analysis of sub-Gaussian thinning.
result Guarantees high-quality compression for any distribution and kernel.
We consider the problem of active coarse ranking, where the goal is to sort items according to their means into clusters of pre-specified sizes, by adaptively sampling from their reward distributions. This setting is useful in many social science applications involving human raters and the approximate rank of every ite…
Bayesian model improves image completion accuracy by automatically learning low rank structure.
problem Improving image completion accuracy with limited data and avoiding overfitting.
method Developed a Bayesian low rank tensor ring model with multiplicative interaction and Student-T distribution for sparse core factors.
result The proposed method outperforms state-of-the-art image completion techniques, especially in recovery accuracy.
Study of singular curves in a specific type of hyperbolic distribution.
problem Characterizing singular curves in hyperbolic (4,7)-distributions. method Introduced hyperbolic (4,7)-distributions of type C3, described singular curves via prolongations. result Completely described singular curves for hyperbolic (4,7)-distributions of type C3. RCPO uses ranked choice modeling for better LLM alignment.
problem Pairwise preference optimization limits LLM alignment.
method Unified framework combining preference optimization and ranked choice modeling.
result RCPO outperforms competitive baselines in LLM alignment.
This paper improves model robustness to underrepresented groups using ranking metrics and reweighting.
problem Underrepresented groups suffer from low accuracy in models trained via ERM.
method Proposes Discounted Cumulative Gain (DCG) and Discounted Rank Upweighting (DRU) methods.
result Models trained with DRU show superior generalization to unseen groups.
We consider bundle homomorphisms between tangent distributions and vector bundles of the same rank. We study the conditions for fundamental singularities when the bundle homomorphism is induced from a Morin map. When the tangent distribution is the contact structure, we characterize singularities of the bundle homomorp…
Characterizes uncertainty in low-rank matrix completion with noisy data.
problem Uncertainty quantification in low-rank matrix completion with heterogeneous sub-exponential noise.
method Characterizes the distribution of estimated matrix entries under low-rank estimators with heterogeneous sub-exponential noise.
result Explicit formulas for the distribution of estimated matrix entries under Poisson and Binary noise.
The paper analyzes tensor recovery from symmetric rank-one measurements using information theory.
problem Recovering tensors with low symmetric rank from symmetric rank-one measurements.
method Covering numbers argument, Carbery-Wright inequality, orthogonal polynomials, Fano's inequality.
result Near-optimal sample complexity bounds for log-concave distributions.