arXiv research

This paper tackles combinatorial optimization under uncertainty with limited feedback.

This paper tackles combinatorial pure exploration for dueling bandits, aiming to find the best candidate-position match.

Study on identifying the best decision with continuous, separable rewards in stochastic multi-armed bandit.

New algorithm finds high-reward combinatorial sets with fewest pulls.

The paper tackles combinatorial pure exploration with various feedback structures and proposes efficient algorithms.

New algorithm identifies optimal actions in large reward spaces efficiently.

New algorithms find the best subset of distributions with minimal samples.

Algorithm identifies best arm in combinatorial bandits with semi-bandit feedback.

We study a specific \textit{combinatorial pure exploration stochastic bandit problem} where the learner aims at finding the set of arms whose means are above a given threshold, up to a given precision, and \textit{for a fixed time horizon}. We propose a parameter-free algorithm based on an original heuristic, and prove…

Polynomial-time algorithms for identifying the best super arm in full-bandit feedback.

Paper explores algebraic, topological, and combinatorial properties of singular virtual braids.

We study the combinatorial pure exploration problem Best-Set in stochastic multi-armed bandits. In a Best-Set instance, we are given $n$ arms with unknown reward distributions, as well as a family $\mathcal{F}$ of feasible subsets over the arms. Our goal is to identify the feasible subset in $\mathcal{F}$ with the maxi…

New algorithms improve hiring decisions by optimizing tiered interview processes.

This paper explores how boolean formulas can be learned by deep neural networks.

Pure combinatorial models for BPL_n and Gauss map of a combinatorial manifold are described.

New method classifies spinor orbits in dimensions up to 14.

Combinatorial proof shows knot invariant in Lipshitz's grid homology.

New experimental design minimizes regret in bandits.

Efficiently clusters noisy data with minimal queries.

KG-A2C agent learns natural language IF games by reasoning and constraining action spaces.

Combinatorial proof of grid homology properties.

Goussarov, Polyak, and Viro proved that finite type invariants of knots are ``finitely multi-local'', meaning that on a knot diagram, sums of quantities, defined by local information, determine the value of the knot invariant. The result implies the existence of Gauss diagram combinatorial formulas for finite type inva…

Given an orientable surface with boundary and a free homotopy class, we present a purely combinatorial algorithm which produces a representative of that homotopy class with minimal self intersection.

Optimizes matching in weighted graphs with semi-bandit sampling.

The paper tackles pure exploration in multi-armed bandits with low rank structure using oblivious sampling.

This work introduces CAET, an algorithm for cost-aware pairwise pure exploration.

The paper offers efficient algorithms for combinatorial and linear bandits using empirical process theory.

Given a grid presentation of a knot (or link) K in the three-sphere, we describe a Heegaard diagram for the knot complement in which the Heegaard surface is a torus and all elementary domains are squares. Using this diagram, we obtain a purely combinatorial description of the knot Floer homology of K.

Study on sample complexity for pure exploration in feedback graph settings.

This paper explores Brunnian twin groups and their properties.

Unified algorithm for efficient pure exploration using dual variables.

Study inert and ambiguous classes in modular group using combinatorial methods.

New algorithm finds optimal sample complexity for pure exploration with multiple good answers.

Develops first optimal algorithm for logistic bandits.

Study explores properties of bipartite knots.

Optimizes pure exploration in linear bandits with a new algorithm.

Study pure exploration in high-dimensional feature spaces using adaptive embeddings.

The study analyzes batched methods for early stopping in stochastic multi-armed bandits.

We present in this article a family of new combinatorial identities via purely differential/complex geometry methods, which include as a speical case a unified and explicit formula for Chern numbers of all complex flag manifolds. Our strategy is to construct concrete circle actions with isolated fixed points on these m…

New exploration bonuses improve reinforcement learning efficiency.

It is shown that for any piecewise-linear closed orientable manifold of odd dimension there exists an invariantly defined metric on the determinant line of cohomology with coefficients in an arbitrary flat bundle E over the manifold (E is not required to be unimodular). The construction of this metric (called Poincare …

New algorithm eliminates arms to minimize regret in complex bandit problems.

New algorithms solve games to find optimal exploration strategies.

Proposes qPO, a new acquisition strategy for batched Bayesian optimization that maximizes the probability of including the optimum.

We prove that the complement of any affine 2-arrangement in R^d is minimal, that is, it is homotopy equivalent to a cell complex with as many i-cells as its i-th rational Betti number. For the proof, we provide a Lefschetz-type hyperplane theorem for complements of 2-arrangements, and introduce Alexander duality for co…

Tightness of a triangulated manifold is a topological condition, roughly meaning that any simplexwise linear embedding of the triangulation into euclidean space is "as convex as possible". It can thus be understood as a generalization of the concept of convexity. In even dimensions, super-neighborliness is known to be …

Constructs subvarieties in translation surface strata using combinatorial input.

VCSMC improves efficiency in Bayesian phylogenetic inference.