arXiv research

This paper applies combinatorial testing to machine learning for robust model performance.

We propose a new family of combinatorial inference problems for graphical models. Unlike classical statistical inference where the main interest is point estimation or parameter testing, combinatorial inference aims at testing the global structure of the underlying graph. Examples include testing the graph connectivity…

Relative notions of combinatorial asphericity have been used to prove that injective labeled oriented trees (which encode spines of ribbon 2-knots) are aspherical. This article presents an overview and comparison of the different notions of relative combinatorial asphericity. It also contains new results concerning cha…

The paper classifies equivariant test configurations for spherical varieties.

Machine learning reduces combinatorial optimization problem dimensions.

The study analyzes group testing algorithms for identifying defective items with high confidence.

The paper classifies test configurations and derives a criterion for uniform K-stability of certain algebraic varieties.

Study tackles distribution shift in combinatorial settings using matrix completion techniques.

Linear-time graph optimization using reinforcement learning.

The paper simplifies K-stability conditions for spherical varieties.

This paper presents a framework to tackle combinatorial optimization problems using neural networks and reinforcement learning. We focus on the traveling salesman problem (TSP) and train a recurrent network that, given a set of city coordinates, predicts a distribution over different city permutations. Using negative t…

New algorithm reduces super-arm selection complexity exponentially.

We investigate the piecewise-stationary combinatorial semi-bandit problem. Compared to the original combinatorial semi-bandit problem, our setting assumes the reward distributions of base arms may change in a piecewise-stationary manner at unknown time steps. We propose an algorithm, \texttt{GLR-CUCB}, which incorporat…

We study the fundamental tradeoffs between computational tractability and statistical accuracy for a general family of hypothesis testing problems with combinatorial structures. Based upon an oracle model of computation, which captures the interactions between algorithms and data, we establish a general lower bound tha…

Diagrammatic reducibility DR and its generalization vertex asphericity VA are combinatorial tools developed for detecting asphericity of a 2-complex. Here we present tests for a relative version of VA that apply to pairs of 2-complexes $(L,K)$, where $K$ is a subcomplex of $L$. We show that a relative weight test holds…

The study establishes conditions for positive and quasi-positive links.

In sponsored search, keyword recommendations help advertisers to achieve much better performance within limited budget. Many works have been done to mine numerous candidate keywords from search logs or landing pages. However, the strategy to select from given candidates remains to be improved. The existing relevance-ba…

Many real-world problems can be reduced to combinatorial optimization on a graph, where the subset or ordering of vertices that maximize some objective function must be found. With such tasks often NP-hard and analytically intractable, reinforcement learning (RL) has shown promise as a framework with which efficient he…

The paper classifies and computes limits of equivariant compactifications of groups.

Metric learning enhances combinatorial coverage metrics' ability to predict classification errors.

Study adapts combinatorial semi-bandit for piecewise stationary, causally related rewards.

Paper computes stability of Q-Fano spherical varieties using test configurations and Futaki invariants.

Meta-SAGE improves deep RL scalability for CO tasks by adapting pre-trained models to larger-scale problems.

This paper explores the information-theoretic limitations of graph property testing in zero-field Ising models. Instead of learning the entire graph structure, sometimes testing a basic graph property such as connectivity, cycle presence or maximum clique size is a more relevant and attainable objective. Since property…

We introduce a novel algorithm that computes the $k$-sparse principal component of a positive semidefinite matrix $A$. Our algorithm is combinatorial and operates by examining a discrete set of special vectors lying in a low-dimensional eigen-subspace of $A$. We obtain provable approximation guarantees that depend on t…

The search for higher-order feature interactions that are statistically significantly associated with a class variable is of high relevance in fields such as Genetics or Healthcare, but the combinatorial explosion of the candidate space makes this problem extremely challenging in terms of computational efficiency and p…

We learn sensor trees from training data to minimize sensor acquisition costs during test time. Our system adaptively selects sensors at each stage if necessary to make a confident classification. We pose the problem as empirical risk minimization over the choice of trees and node decision rules. We decompose the probl…

We focus on kernel methods for set-valued inputs and their application to Bayesian set optimization, notably combinatorial optimization. We investigate two classes of set kernels that both rely on Reproducing Kernel Hilbert Space embeddings, namely the ``Double Sum'' (DS) kernels recently considered in Bayesian set opt…

Quantum computing exploits basic quantum phenomena such as state superposition and entanglement to perform computations. The Quantum Approximate Optimization Algorithm (QAOA) is arguably one of the leading quantum algorithms that can outperform classical state-of-the-art methods in the near term. QAOA is a hybrid quant…

Novel theory combines combinatorial and topological elements.

The paper introduces combinatorial Calabi flows to find hyperbolic metrics on surfaces with boundary.

Adaptive RL optimizes testing resource allocation for dynamic software environments.

We consider the change-point detection problem of deciding, based on noisy measurements, whether an unknown signal over a given graph is constant or is instead piecewise constant over two connected induced subgraphs of relatively low cut size. We analyze the corresponding generalized likelihood ratio (GLR) statistics a…

Study provides selective inference method for latent block models.

The paper develops algorithms for finding metrics with prescribed combinatorial curvature on polyhedral surfaces.

The paper introduces combinatorial curvature and flow for polyhedral surfaces, proving rigidity and solving the Yamabe problem.

We prove a criterion for K-stability of a $\mathbb{Q}$-Fano spherical variety with respect to equivariant special test configurations, in terms of its moment polytope and some combinatorial data associated to the open orbit. Combined with the equivariant version of the Yau-Tian-Donaldson conjecture for Fano manifolds p…

For triangulated surfaces, we introduce the combinatorial Calabi flow which is an analogue of smooth Calabi flow. We prove that the solution of combinatorial Calabi flow exists for all time. Moreover, the solution converges if and only if Thurston's circle packing exists. As a consequence, combinatorial Calabi flow pro…

Subjective expected utility theory assumes that decision-makers possess unlimited computational resources to reason about their choices; however, virtually all decisions in everyday life are made under resource constraints - i.e. decision-makers are bounded in their rationality. Here we experimentally tested the predic…

New test assesses reliability of auto-generated features.

Fractional combinatorial flow improves surface conformal structures.

Proves Yau-Tian-Donaldson conjecture for cohomogeneity one manifolds.

Combinatorial method computes Legendrian knot invariant.

We combine Recurrent Neural Networks with Tensor Product Representations to learn combinatorial representations of sequential data. This improves symbolic interpretation and systematic generalisation. Our architecture is trained end-to-end through gradient descent on a variety of simple natural language reasoning tasks…

Polynomial-time method solves complex combinatorial semi-bandits.

New combinatorial structure for hierarchically hyperbolic spaces.

New method finds metrics on surfaces with prescribed curvatures using circle packings and surgery.

Combinatorial Ricci flow finds hyperbolic metrics on 3-manifolds.