The paper studies horofunction compactifications of symmetric cones under Finsler distances.
problem Understanding horofunction compactifications of symmetric cones under Finsler distances.
method Establishing a correspondence between horofunction compactifications of symmetric cones and normed spaces, using Thompson and Hilbert distances.
result Explicit extensions of the exponential map and characterizations of horofunctions for Thompson and Hilbert distances.
New bounds found for complexity of spun knots.
problem Measuring complexity of spun knots.
method Using bridge trisections and distances in the pants complex.
result Bound the Kirby-Thompson invariant of spun knots.
Sharp bounds for Kirby-Thompson invariants of knotted surfaces computed.
problem Computing sharp lower bounds for Kirby-Thompson invariants of knotted surfaces.
method Using dual curve complex distances to compute invariants.
result Exact values of KT-invariants computed for knotted surfaces with bridge number ≤ 6.
The distance from the origin in the word metric for generalizations F(p) of Thompson's group F is quasi-isometric to the number of carets in the reduced rooted tree diagrams representing the elements of F(p). This interpretation of the metric is used to prove that every F(p) admits a quasi-isometric embedding into ever…
We adapt work of Kirby-Thompson and Zupan to define an integer invariant L(T) of a bridge trisection T of a smooth surface K in S4 or B4. We show that when L(T)=0, then the surface K is unknotted. We also show show that for a trisecti…
This paper states a formula for the difference of the Holmes-Thompson volumes of two simple Finsler manifolds of arbitrary dimension, in terms of the boundary distances and their derivatives. An application is a preconditioned filling minimality result.
We show that the volume of a simple Riemannian metric on Dn is locally monotone with respect to its boundary distance function. Namely if g is a simple metric on Dn and g′ is sufficiently close to g and induces boundary distances greater or equal to those of g, then vol(Dn,g′)≥vol(Dn,g). Furthermor…
We show that the number of stabilizations needed to interchange the handlebodies of a Heegaard splitting of a closed 3-manifold by an isotopy is bounded below by the smaller of twice its genus or half its Hempel distance. This is a combinatorial version of a proof by Hass, Thompson and Thurston of a similar theorem, bu…
The paper sets lower bounds for a Kirby-Thompson invariant of 4-manifolds.
problem Determining the Kirby-Thompson invariant of specific 4-manifolds.
method Using trisections, the paper establishes lower bounds and calculates the invariant for specific examples.
result The paper calculates the Kirby-Thompson invariant of the spin of L(2,1) and shows the existence of 4-manifolds with arbitrarily large invariants. New algorithm finds k-centers from noisy distance estimates.
problem Finding k-centers in unknown metric spaces with noisy distance queries.
method Active algorithms using UCB, Thompson Sampling, and Track-and-Stop.
result Approximation ratio of two with high probability.
Develops a combinatorial semi-bandit method for electric vehicle charging station selection.
problem Long-distance navigation for BEVs with unknown charging station availability and performance.
method Combinatorial semi-bandit framework, pre-processing road network, Bayesian modeling, Thompson Sampling, BayesUCB, Epsilon-greedy.
result Demonstrates improved navigation performance on long-distance BEV charging station selection.
Positive Thompson links are arborescent tangles.
problem Understanding the structure of Thompson group elements.
method Analyzing closures of bipartite arborescent tangles.
result Positive Thompson links correspond to arborescent tangles.
A new approach for efficient batch multiobjective optimization using Thompson sampling.
problem Inefficient batch multiobjective optimization due to expensive oracles and hard inner optimization.
method Proposes a Thompson sampling approach (qextttPOTS) that chooses Pareto optimal candidates sequentially. result Empirically superior performance compared to classical evolutionary approaches and MOBO.
Positive Thompson links are proven for oriented subgroup elements.
problem Proving properties of Thompson links with positive elements.
method Analyzing elements of the oriented subgroup of the Thompson group.
result Positive oriented Thompson links are established.
Thompson sampling provides a solution to bandit problems in which new observations are allocated to arms with the posterior probability that an arm is optimal. While sometimes easy to implement and asymptotically optimal, Thompson sampling can be computationally demanding in large scale bandit problems, and its perform…
Jones constructs knots from Thompson group elements.
problem No specific problem stated; focuses on constructions.
method Constructions of knots from Thompson group elements.
result Introduced two types of knots: oriented and unoriented.
New method counts link components from Thompson group elements.
problem Counting connected components of positive Thompson links.
method Defining Thompson permutations from Thompson group elements.
result Number of orbits equals number of link components.
Extends Jones' construction to Thompson's group F and link homology.
problem Link homology and Thompson's group F.
method Asymptotic construction of (n,n)-tangles in Thompson's group F. result Asymptotically faithful association of (n,n)-tangles with elements of Thompson's group F. Optimizes Thompson sampling policies using policy gradient methods.
problem Improving Thompson sampling in bandit problems.
method Applies policy gradient algorithms to optimize Thompson sampling policies.
result Direct policy search on Thompson sampling improves performance.
This paper proves a conjecture about trisections with a specific length.
problem Proving a conjecture about trisections with a specific length.
method Examining trisections with Kirby-Thompson length 2 and proving the conjecture.
result Proves the conjecture about length 2 trisection being a 4-manifold with length 0.
New method targets vaccines for new variants using Thompson sampling.
problem Deciding how to prioritize vaccines for new variants with delayed feedback.
method Partial likelihood Thompson sampling, updating beliefs with partial likelihood.
result Method effectively prioritizes vaccines based on real-world data.
Thompson sampling has impressive empirical performance for many multi-armed bandit problems. But current algorithms for Thompson sampling only work for the case of conjugate priors since these algorithms require to infer the posterior, which is often computationally intractable when the prior is not conjugate. In this …
Improved Thompson Sampling reduces regret in contextual bandits and reinforcement learning.
problem Thompson Sampling's exploration is insufficient in some contexts.
method Developed Feel-Good Thompson Sampling to address exploration issues.
result Feel-Good Thompson Sampling reduces regret compared to standard Thompson Sampling.
New Thompson sampling algorithm for stochastic partial monitoring achieves logarithmic regret.
problem Limited feedback in sequential learning problems.
method Developed a novel Thompson-sampling-based algorithm to sample from the posterior distribution exactly.
result Achieved logarithmic regret bound of O(log T) for a linearized variant of the problem.
Brin-Thompson groups have new properties for n>=2.
problem Characterize subgroups of Brin-Thompson groups.
method Analyzing torsion and subgroup structure.
result Brin-Thompson groups nV for n≥2 contain continuum many copies of Q. New p-colorable subgroup derived from Thompson's group.
problem Constructing p-colorable knots and links from Thompson's group elements. method Defining and proving isomorphism of p-colorable subgroup. result The p-colorable subgroup is isomorphic to a Brown--Thompson group. New family of braided Thompson groups introduced using recursive braids.
problem Dehornoy-Brin braided Thompson group generalization.
method Using recursive braids and strand diagrams to define new groups.
result New groups BVn,r(H) are finitely generated if H is finitely generated. Extends Thompson sampling for RL with fewer episodes.
problem Limited episodes in RL settings.
method Batch Bayesian optimization over episodes to learn action bias terms.
result Significantly outperforms standard Thompson sampling.
Thompson sampling, a Bayesian method for balancing exploration and exploitation in bandit problems, has theoretical guarantees and exhibits strong empirical performance in many domains. Traditional Thompson sampling, however, assumes perfect compliance, where an agent's chosen action is treated as the implemented actio…
New virtual version of Thompson's group created to handle virtual knots.
problem Creating a mathematical framework for virtual knots.
method Defining a virtual version of Thompson's group and proving its properties.
result Any virtual link can be constructed from an element of the new virtual Thompson's group.
Study of quasimorphisms and bounded cohomology in braided Thompson groups.
problem Investigate quasimorphisms and bounded cohomology in braided versions of Thompson groups.
method Analyze quasimorphisms and bounded cohomology of various braided Thompson groups.
result Found infinite-dimensional spaces of quasimorphisms in some braided Thompson groups and trivial second bounded cohomology in others.
Thompson sampling used for linear bandits with normal-gamma priors.
problem Optimizing decisions in uncertain environments with linear dependencies and unknown parameters.
method Bayesian Thompson sampling with multivariate normal-gamma priors.
result Derivation of a Bayesian regret bound for the approach.
Improved Thompson Sampling algorithms for bandits with tighter regret bounds.
problem Efficient and adaptive algorithms for stochastic bandits with bounded rewards.
method Proposed two parameterized Thompson Sampling-based algorithms: TS-MA-α and TS-TD-α.
result Achieved O(Kln^(α+1)(T)/Δ) regret bound, improving scalability and resource allocation.
We consider Thompson's groups from the perspective of mapping class groups of surfaces of infinite type. This point of view leads us to the braided Thompson groups, which are extensions of Thompson's groups by infinite (spherical) braid groups. We will outline the main features of these groups and some applications to …
New method associates annular links to elements of Thompson's group T.
problem Associating annular links to elements of Thompson's group T.
method Edge-signed graphs embedded in annuli and unitary representations of T.
result Tait graphs of annular links can be constructed from elements of T.
Thompson Sampling, one of the oldest heuristics for solving multi-armed bandits, has recently been shown to demonstrate state-of-the-art performance. The empirical success has led to great interests in theoretical understanding of this heuristic. In this paper, we approach this problem in a way very different from exis…
Paper improves Thompson Sampling for linear contextual bandits.
problem Empirical Thompson Sampling does not achieve optimal regret bounds.
method Develops a novel estimator with adaptive data augmentation and coupling.
result Achieves nearly minimax optimal performance.
Half grid diagrams prove every link can be represented by a special type of grid diagram.
problem Representing links using grid diagrams and related invariants.
method Defining half grid diagrams and constructing canonical pairs, proving equivalence to Jones' construction, relating to classical link invariants.
result Established a new method to relate the oriented Thompson index to classical link invariants and provided bounds for knot invariants.
New methods use Conway tangles to generate knots and links.
problem Constructing knots and links using Thompson's group elements.
method Using Conway rational tangles to find Thompson group elements.
result Methods to construct any product or concatenation of simple tangles.
Thompson sampling is an efficient algorithm for sequential decision making, which exploits the posterior uncertainty to address the exploration-exploitation dilemma. There has been significant recent interest in integrating Bayesian neural networks into Thompson sampling. Most of these methods rely on global variable u…
Thompson sampling is one of the most widely used algorithms for many online decision problems, due to its simplicity in implementation and superior empirical performance over other state-of-the-art methods. Despite its popularity and empirical success, it has remained an open problem whether Thompson sampling can match…
Improved statistical inference for adaptive Thompson Sampling.
problem Statistical inference challenges in Thompson Sampling.
method Inflating posterior variance in Thompson Sampling.
result Asymptotically normal estimates of arm means with logarithmic regret increase.
We describe a procedure for constructing a generalized Thompson group out of a family of groups that is equipped with what we call a cloning system. The previously known Thompson groups F, V, Vbr and Fbr arise from this procedure using, respectively, the systems of trivial groups, symmetric groups, braid groups and pur…
This paper explores links from Thompson's group conjugacy classes.
problem Understanding the relationship between Thompson's group conjugacy classes and links.
method Using Jones's construction to link elements of F to unoriented links. result Found sequences of elements from distinct conjugacy classes yielding specific links.
This paper applies Thompson Sampling to asymmetric α-stable bandits for financial and wireless data.
problem Optimizing exploration-exploitation in multi-armed bandits with asymmetric α-stable distributions. method Thompson Sampling applied to unknown asymmetric α-stable reward distributions. result Demonstrates effectiveness of Thompson Sampling for asymmetric α-stable bandits. Improved Thompson Sampling for high-dimensional sparse bandits.
problem Stochastic linear contextual bandits with high-dimensional features.
method Thompson Sampling with spike-and-slab priors and variational inference.
result Nearly optimal upper bound on expected cumulative regret.
Paper proves almost all stabilizer subgroups of Thompson's group satisfy Alexander's theorem.
problem Alexander's theorem for stabilizer subgroups of Thompson's group.
method Defined a method to construct knots and links from Thompson's group F and proved Alexander's theorem for stabilizer subgroups.
result Almost all stabilizer subgroups under the natural action on the unit interval satisfy Alexander's theorem.
The group of C1-diffeomorphisms of any sparse Cantor subset of a manifold is countable and discrete (possibly trivial). Thompson's groups come out of this construction when we consider central ternary Cantor subsets of an interval. Brin's higher dimensional generalizations nV of Thompson's group V arise…