Regularizes RNNs to be invariant to input order.
problem Making RNNs invariant to input order.
method Stochastic regularization to enforce permutation invariance.
result Improves model performance on permutation invariant tasks.
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
48 results for “permutation problem”
New neural network architecture for auction design exploiting permutation symmetry.
problem Designing incentive-compatible auctions that maximize expected revenue.
method Constructed a permutation-equivariant neural network architecture.
result Permutation-equivariant architectures can perfectly recover optimal mechanisms.
Bayesian optimization method for permutations accelerates combinatorial search.
problem Optimizing expensive-to-evaluate objectives on permutation problems.
method LAW2ORDER, a batch Bayesian optimization method based on the acquisition weighted kernel.
result LAW2ORDER achieves sublinear batch cumulative regret, demonstrating accelerated search.
Resolving Schwartz's quadratic meander number conjecture
problem Meander number of cyclic permutations
method Constructing families of cyclic permutations
result Meander number is bounded above and below quadratically in n
We tackle permutation in linear regression with a new inference framework.
problem Statistical investigation of permutation in linear regression models.
method Localization step followed by conditional Monte Carlo test and coefficient inference.
result Valid statistical inference procedures for permutation and regression coefficients.
Many problems at the intersection of combinatorics and computer science require solving for a permutation that optimally matches, ranks, or sorts some data. These problems usually have a task-specific, often non-differentiable objective function that data-driven algorithms can use as a learning signal. In this paper, w…
We consider the problem of noisy matrix completion, in which the goal is to reconstruct a structured matrix whose entries are partially observed in noise. Standard approaches to this underdetermined inverse problem are based on assuming that the underlying matrix has low rank, or is well-approximated by a low rank matr…
UPCA solves data matrix completion with permuted columns.
problem Data matrix completion with permuted columns.
method Algebraic geometry and two-stage algorithm.
result UPCA recovers the ground-truth matrix from corrupted data.
Statistical and Computational Efficiency for Smooth Tensor Estimation with Unknown Permutationsmath.ST
We tackle tensor denoising with unknown permutations, achieving optimal recovery with polynomial estimators.
problem Structured tensor denoising with unknown permutations in recommendation systems, neuroimaging, etc.
method Developed a constrained least-squares estimator in a block-wise polynomial family.
result Achieved the minimax error bound with polynomial estimators of degree up to .
Unlabeled sensing is a linear inverse problem where the measurements are scrambled under an unknown permutation leading to loss of correspondence between the measurements and the rows of the sensing matrix. Motivated by practical tasks such as mobile sensor networks, target tracking and the pose and correspondence esti…
Efficiently discovers causal DAG permutations without additional assumptions.
problem Learning a DAG up to Markov equivalence.
method Utilizing DAG-specific problem structure, introduces an efficient algorithm for sparse permutations.
result Significant improvement in permutation discovery compared to existing algorithms.
We show that, in a resource allocation problem, the ex ante aggregate utility of players with cumulative-prospect-theoretic preferences can be increased over deterministic allocations by implementing lotteries. We formulate an optimization problem, called the system problem, to find the optimal lottery allocation. The …
Improves modeling of sets with permutation invariant densities.
problem Challenges in calculating trace limit practicality of current methods.
method Proposes an alternative approach to define permutation equivariant transformations with closed form trace.
result Improves both training and final performance.
Permutation-equivariant neural networks improve auction mechanisms by reducing regret and sample complexity.
problem Designing optimal auction mechanisms that balance revenue and bidders' regret.
method Introduced permutation-equivariant neural networks to auction mechanisms.
result Permutation-equivariant neural networks decrease expected ex-post regret and improve model generalizability.
A new method reduces memory requirements for sorting high-dimensional data.
problem Efficiently sorting and organizing high-dimensional data with low memory usage.
method Iteratively shuffles N indices and applies SoftSort optimization steps.
result Significantly improves sorting quality for multidimensional data.
New method for accurate permutation inference in CCA.
problem Inaccurate permutation inference in CCA.
method Proposed solutions for permutation inference in CCA, including transforming residuals and stepwise estimation.
result Valid permutation tests for CCA with and without nuisance variables.
In regression analysis of multivariate data, it is tacitly assumed that response and predictor variables in each observed response-predictor pair correspond to the same entity or unit. In this paper, we consider the situation of "permuted data" in which this basic correspondence has been lost. Several recent papers hav…
A new method reduces computational costs for testing RF variable importance measures.
problem Testing variable importance measures from random forests is computationally expensive and challenging.
method Sequential permutation testing and sequential p-value estimation to reduce computational costs.
result Theoretical properties of sequential tests are confirmed, maintaining type-I error and high power.
In this work we study permutation synchronisation for the challenging case of partial permutations, which plays an important role for the problem of matching multiple objects (e.g. images or shapes). The term synchronisation refers to the property that the set of pairwise matchings is cycle-consistent, i.e. in the full…
Permutation-equivariant and Proximity-aware Graph Neural Networks with Stochastic Message Passingcs.LG
SMP model preserves proximity and permutation in graph neural networks.
problem Challenges in graph mining, such as community and leader finding.
method Stochastic Message Passing (SMP) model that maintains proximity and permutation-equivariance.
result SMP model effectively preserves node proximities and permutation-equivariance.
Many matching, tracking, sorting, and ranking problems require probabilistic reasoning about possible permutations, a set that grows factorially with dimension. Combinatorial optimization algorithms may enable efficient point estimation, but fully Bayesian inference poses a severe challenge in this high-dimensional, di…
Deep Setscs.LG
We study the problem of designing models for machine learning tasks defined on \emph{sets}. In contrast to traditional approach of operating on fixed dimensional vectors, we consider objective functions defined on sets that are invariant to permutations. Such problems are widespread, ranging from estimation of populati…
In this paper, we consider the problem of learning functions over sets, i.e., functions that are invariant to permutations of input set items. Recent approaches of pooling individual element embeddings can necessitate extremely large embedding sizes for challenging functions. We address this challenge by allowing stand…
Deep neural networks have demonstrated cutting edge performance on various tasks including classification. However, it is well known that adversarially designed imperceptible perturbation of the input can mislead advanced classifiers. In this paper, Permutation Phase Defense (PPD), is proposed as a novel method to resi…
Consider a noisy linear observation model with an unknown permutation, based on observing , where is an unknown vector, is an unknown permutation matrix, and is additive Gaussian noise. We analyze the problem of permutation recovery in a …
A new method resolves permutation issues in shuffled linear regression for large-scale applications.
problem Estimating latent features through linear transformation with unknown permutations.
method Spectral matching method to align spectral components of measurement and feature covariances.
result Achieves accurate estimates in shuffled LS and LASSO settings with sufficient samples.
Regularization for Shuffled Data Problems via Exponential Family Priors on the Permutation Groupstat.ML
New method uses exponential family priors to handle shuffled data problems.
problem Handling mismatch errors in record linkage of two data files.
method Flexible exponential family prior on the permutation group for regularization.
result The proposed method outperforms competing methods in synthetic and real data.
Cheap Permutation Testingmath.ST
Cheap permutation tests speed up distribution testing without sacrificing accuracy.
problem Efficiently testing distribution differences and independence.
method Group datapoints into bins and permute only these bins, using stored sufficient statistics.
result Cheap permutation tests maintain the accuracy and optimality of standard tests but are significantly faster.
C-OPH improves One Permutation Hashing by using a shorter circulant permutation.
problem Improving the accuracy of One Permutation Hashing (OPH) for Jaccard similarity estimation.
method Develops a new densification method using a shorter circulant permutation.
result Achieves the smallest estimation variance for Jaccard similarity.
Random permutations can offer faster convergence than with-replacement sampling for some functions.
problem Understanding when and how random permutations outperform with-replacement sampling in SGD convergence.
method Analyzing convergence rates for different function classes (1D strongly convex, general strongly convex, quadratic strongly convex).
result The optimal convergence gap between random and permutation-based SGD varies from exponential to nonexistent, depending on the function class.
Representations of sets are challenging to learn because operations on sets should be permutation-invariant. To this end, we propose a Permutation-Optimisation module that learns how to permute a set end-to-end. The permuted set can be further processed to learn a permutation-invariant representation of that set, avoid…
Variable selection in sparse regression models is an important task as applications ranging from biomedical research to econometrics have shown. Especially for higher dimensional regression problems, for which the link function between response and covariates cannot be directly detected, the selection of informative va…
Unknotted cyclesmath.CO
Permutations linked to knots and links, with unknots counted by Schröder numbers.
problem Understanding permutations as knots and links.
method Using grid diagrams and Bennequin's inequality.
result Permutations corresponding to unknots and links are counted by Schröder numbers.
We consider the question of existence of ramified covers over P_1 matching certain prescribed ramification conditions. This problem has already been faced in a number of papers, but we discuss alternative approaches for an existence proof, involving elliptic curves and universal ramified covers with signature. We also …
In "Unlabeled Sensing", one observes a set of linear measurements of an underlying signal with incomplete or missing information about their ordering, which can be modeled in terms of an unknown permutation. Previous work on the case of a single noisy measurement vector has exposed two main challenges: 1) a high requir…
Permutability of surface transforms yields discrete analogs.
problem Discretization of smooth surfaces with specific properties.
method Permutability of transforms of smooth surfaces.
result Discrete surfaces with discrete analogs of original properties.
New method uses Multiple Choice Learning for speech separation.
problem Ambiguous task of assigning model predictions to ground truth signals.
method Uses Multiple Choice Learning (MCL) instead of Permutation Invariant Training (PIT).
result MCL matches PIT performance but is computationally advantageous.
A new permutation method improves two-sample testing power.
problem Two-sample testing with improved power and validity.
method Structured block-restricted cross-swaps.
result Block-restricted permutations achieve higher power than full permutations.
Estimates isotonic functions under unknown permutations, achieving optimal statistical and computational efficiency.
problem Estimating isotonic functions with unknown permutations in multiway comparison data.
method Mirsky partition estimator for minimax optimal and adaptive estimation.
result Achieves optimal worst-case statistical performance and computational efficiency.
Recently, the method of b-bit minwise hashing has been applied to large-scale linear learning and sublinear time near-neighbor search. The major drawback of minwise hashing is the expensive preprocessing cost, as the method requires applying (e.g.,) k=200 to 500 permutations on the data. The testing time can also be ex…
We present a novel algorithm, Westfall-Young light, for detecting patterns, such as itemsets and subgraphs, which are statistically significantly enriched in one of two classes. Our method corrects rigorously for multiple hypothesis testing and correlations between patterns through the Westfall-Young permutation proced…
New algorithm finds sparse matrices on Stiefel manifold for optimisation.
problem Finding sparse matrices on Stiefel manifold for optimisation.
method Modified Orthogonal Iteration algorithm for sparse global optimality.
result Proposed method finds globally optimal sparse Stiefel matrices.
The introduction of convolutional layers greatly advanced the performance of neural networks on image tasks due to innately capturing a way of encoding and learning translation-invariant operations, matching one of the underlying symmetries of the image domain. In comparison, there are a number of problems in which the…
New link topology connects permutation discrepancies to Diaconis-Graham inequalities.
problem Characterize permutations for which Diaconis-Graham inequalities hold with equality.
method Relate permutation discrepancies to the Euler characteristic of their associated links.
result Permutation discrepancies are directly related to the Euler characteristic of their associated links.
New method for regression in high-dimensional space using mixture modeling and optimal transport.
problem Regression in high-dimensional space with unordered data.
method Mixture modeling and optimal transport for permutation recovery and denoising.
result Explicit upper bounds on mean squared denoising error for Gaussian noise.
Theoretical guarantees for permutation-equivariant QNNs avoid barren plateaus.
problem Excessive local minima and barren plateaus in QNNs training landscapes.
method Designing -equivariant QNNs to encode permutation symmetry.
result Equivariant QNNs do not suffer from barren plateaus, quickly reach overparametrization, and generalize well.
We consider a simple and overarching representation for permutation-invariant functions of sequences (or multiset functions). Our approach, which we call Janossy pooling, expresses a permutation-invariant function as the average of a permutation-sensitive function applied to all reorderings of the input sequence. This …
This work tackles Bayesian neural networks by addressing loss landscape symmetries.
problem Understanding and optimizing the loss landscape of Bayesian neural networks.
method The approach involves extending marginalized loss barrier formalism to BNNs, proposing a matching algorithm to search for linearly connected solutions using permutation matrices and combinatorial optimization.
result Nearly zero marginalized loss barriers for linearly connected solutions were found.