English
Related papers

Related papers: Amenability, Folner sets, and cooling functions

200 papers

Recent literature has seen a significant focus on building machine learning models with specific properties such as fairness, i.e., being non-biased with respect to a given set of attributes, calibration i.e., model confidence being aligned…

Machine Learning · Computer Science 2023-10-17 Anand Brahmbhatt , Vipul Rathore , Mausam , Parag Singla

This paper introduces a conformal inference method to evaluate uncertainty in classification by generating prediction sets with valid coverage conditional on adaptively chosen features. These features are carefully selected to reflect…

Machine Learning · Statistics 2024-10-31 Yanfei Zhou , Matteo Sesia

Suppose $(X,\sigma)$ is a subshift, $P_X(n)$ is the word complexity function of $X$, and ${\rm Aut}(X)$ is the group of automorphisms of $X$. We show that if $P_X(n)=o(n^2/\log^2 n)$, then ${\rm Aut}(X)$ is amenable (as a countable,…

Dynamical Systems · Mathematics 2020-06-10 Van Cyr , Bryna Kra

We prove the incompatibility of certain desirable properties of community partition quality functions. Our results generalize the impossibility result of [Kleinberg 2003] by considering sets of weaker properties. In particular, we use an…

Physics and Society · Physics 2016-03-03 Arnaud Browet , Julien M. Hendrickx , Alain Sarlette

Various measures can be used to estimate bias or unfairness in a predictor. Previous work has already established that some of these measures are incompatible with each other. Here we show that, when groups differ in prevalence of the…

Applications · Statistics 2017-09-13 Thomas Miconi

We consider definable topological dynamics for $NIP$ groups admitting certain decompositions in terms of specific classes of definably amenable groups. For such a group, we find a description of the Ellis group of its universal definable…

Logic · Mathematics 2019-02-20 Grzegorz Jagiella

In this article, we further develop the thermodynamic formalism of affine iterated function systems with countably many transformations by showing the existence and extending earlier characterisations of the equilibrium states of finite…

Dynamical Systems · Mathematics 2025-01-22 Antti Käenmäki , Ian D. Morris

An agnostic PAC learning algorithm finds a predictor that is competitive with the best predictor in a benchmark hypothesis class, where competitiveness is measured with respect to a given loss function. However, its predictions might be…

Machine Learning · Computer Science 2021-05-24 Guy N Rothblum , Gal Yona

Around a solution of an optimization problem, an "identifiable" subset of the feasible region is one containing all nearby solutions after small perturbations to the problem. A quest for only the most essential ingredients of sensitivity…

Optimization and Control · Mathematics 2012-07-30 Dmitriy Drusvyatskiy , Adrian S. Lewis

Simulated annealing is an effective and general means of optimization. It is in fact inspired by metallurgy, where the temperature of a material determines its behavior in thermodynamics. Likewise, in simulated annealing, the actions that…

Machine Learning · Computer Science 2020-07-01 Avrim Blum , Chen Dan , Saeed Seddighin

We show that elementary amenable groups, which have a bound on the orders of their finite subgroups, admit a finite dimensional model for the classifying space with virtually cyclic isotropy.

Group Theory · Mathematics 2012-01-20 Martin Fluch , Brita E. A. Nucinkis

We study the canonical fair clustering problem where each cluster is constrained to have close to population-level representation of each group. Despite significant attention, the salient issue of having incomplete knowledge about the group…

Machine Learning · Computer Science 2024-11-21 Sharmila Duppala , Juan Luque , John P. Dickerson , Seyed A. Esmaeili

We present a near-optimal reduction from approximately counting the cardinality of a discrete set to approximately sampling elements of the set. An important application of our work is to approximating the partition function $Z$ of a…

Data Structures and Algorithms · Computer Science 2007-05-23 Daniel Stefankovic , Santosh Vempala , Eric Vigoda

In this paper we address the question: How many pairwise non-isomorphic extremely amenable groups are there which are separable metrizable or even Polish? We show that there are continuum many such groups. In fact we construct continuum…

Logic · Mathematics 2026-03-23 Mahmood Etedadialiabadi , Su Gao , Feng Li , Ruiwen Li

The concepts of amenable and compatible functions have been introduced in a recent work, in order to state precise mathematical theorems that guarantee that a backward stable algorithm is also forward stable, and that the composition of two…

Numerical Analysis · Mathematics 2025-07-24 Carlos Beltrán

We first consider three well-known chain conditions in the space of marked groups: the minimal condition on centralizers, the maximal condition on subgroups, and the maximal condition on normal subgroups. For each condition, we produce a…

Group Theory · Mathematics 2015-02-06 Phillip Wesolek , Jay Williams

For a topological group $G$, amenability can be characterized by the amenability of the convolution Banach algebra $L^1(G)$. Here a Banach algebra $A$ is called amenable if every bounded derivation from $A$ into any dual--type…

Functional Analysis · Mathematics 2025-07-01 Hikaru Awazu

We introduce the Solecki submeasure $\sigma(A)=\inf_F\sup_{x,y\in G}|F\cap xAy|/|F|$ and its left and right modifications on a group $G$, and study the interplay between the Solecki submeasure and the Haar measure on compact topological…

Group Theory · Mathematics 2013-08-22 Taras Banakh

We give a definition of amenability at infinity for a locally compact, $\sigma$-compact and Hausdorff etale groupoid and we study in some case the exactness of the reduced $C^*$-algebra of a such groupoid.

Operator Algebras · Mathematics 2014-10-31 Ivan Lassagne

In this paper we show that for every congruent monotileable amenable group $G$ and for every metrizable Choquet simplex $K$, there exists a minimal $G$-subshift, which is free on a full measure set, whose set of invariant probability…

Dynamical Systems · Mathematics 2017-09-26 Paulina Cecchi , María Isabel Cortez