English
Related papers

Related papers: AND Testing and Robust Judgement Aggregation

200 papers

Given a system of functions f = (f1, . . . , fd) analytic on a neighborhood of some compact subset E of the complex plane, we give necessary and sufficient conditions for the convergence with geometric rate of the common denominators of…

Complex Variables · Mathematics 2018-10-17 N. Bosuwan , G. Lopez Lagomasino , Y. Zaldivar Gerpe

For any $T \geq 1$, there are constants $R=R(T) \geq 1$ and $\zeta=\zeta(T)>0$ and a randomized algorithm that takes as input an integer $n$ and two strings $x,y$ of length at most $n$, and runs in time $O(n^{1+\frac{1}{T}})$ and outputs an…

Data Structures and Algorithms · Computer Science 2019-05-10 Michal Koucký , Michael E. Saks

Given a function f: {0,1}^n \to {0,1}, the f-isomorphism testing problem requires a randomized algorithm to distinguish functions that are identical to f up to relabeling of the input variables from functions that are far from being so. An…

Data Structures and Algorithms · Computer Science 2011-12-30 Eric Blais , Amit Weinstein , Yuichi Yoshida

In this work, a convergence lemma for function $f$ being finite compositions of analytic mappings and the maximum operator is proved. The lemma shows that the set of $\delta$-stationary points near an isolated local minimum point $x^*$ is…

Computer Science and Game Theory · Computer Science 2022-08-12 Xiaotie Deng , Hanyu Li , Ningyuan Li

This paper concerns algorithms that give correct answers with (asymptotic) density $1$. A dense description of a function $g : \omega \to \omega$ is a partial function $f$ on $\omega$ such that $\left\{n : f(n) = g(n)\right\}$ has density…

Logic · Mathematics 2018-11-20 Eric P. Astor , Denis R. Hirschfeldt , Carl G. Jockusch

We investigate lower bounds for the variance in arithmetic progressions of certain multiplicative functions "close" to $1$. Specifically, we consider $\alpha_N$-fold divisor functions, when $\alpha_N$ is a sequence of positive real numbers…

Number Theory · Mathematics 2021-02-23 Daniele Mastrostefano

Clustering is a fundamental task in machine learning and data analysis, but it frequently fails to provide fair representation for various marginalized communities defined by multiple protected attributes -- a shortcoming often caused by…

Machine Learning · Computer Science 2025-11-17 Diptarka Chakraborty , Kushagra Chatterjee , Debarati Das , Tien-Long Nguyen

Let $\al$ be an irrational and $\varphi: \N \rightarrow \R^+$ be a function decreasing to zero. For any $\al$ with a given Diophantine type, we show some sharp estimations for the Hausdorff dimension of the set [E_{\varphi}(\al):={y\in \R:…

Dynamical Systems · Mathematics 2012-09-17 Lingmin Liao , Michal Rams

Theory and application of stochastic approximation (SA) have become increasingly relevant due in part to applications in optimization and reinforcement learning. This paper takes a new look at SA with constant step-size $\alpha>0$, defined…

Statistics Theory · Mathematics 2025-11-12 Caio Kalil Lauand , Ioannis Kontoyiannis , Sean Meyn

The logarithmic coefficients $\gamma_n$ of an analytic and univalent function $f$ in the unit disk $\mathbb{D}=\{z\in\mathbb{C}:|z|<1\}$ with the normalization $f(0)=0=f'(0)-1$ are defined by $\log \frac{f(z)}{z}= 2\sum_{n=1}^{\infty}…

Complex Variables · Mathematics 2016-08-25 Md. Firoz Ali , A. Vasudevarao

An algebraic approximation, of order $K$, of a polyhedron correlation function (CF) can be obtained from $\gamma\pp(r)$, its chord-length distribution (CLD), considering first, within the subinterval $[D_{i-1},\, D_i]$ of the full range of…

General Mathematics · Mathematics 2020-12-03 Salvino Ciccariello

We present connections between the recent literature on multigroup fairness for prediction algorithms and classical results in computational complexity. Multiaccurate predictors are correct in expectation on each member of an arbitrary…

Computational Complexity · Computer Science 2024-07-30 Sílvia Casacuberta , Cynthia Dwork , Salil Vadhan

Given $\alpha_1,...,\alpha_m \in (0,1)$, we characterize all integrable functions $f:[0,1]^m \to \mathbb{C}$ satisfying $\int_{A_1 \times ...\times A_m} f =0$ for any collection of disjoint sets $A_1,...,A_m \subseteq [0,1]$ of respective…

Combinatorics · Mathematics 2015-01-19 Hamed Hatami , Pooya Hatami , Yaqiao Li

We derive a specific functional form for factor alpha decay -- hyperbolic decay alpha(t) = K/(1+lambda*t) -- from a game-theoretic equilibrium model, and test it against linear and exponential alternatives. Using eight Fama-French factors…

Portfolio Management · Quantitative Finance 2025-12-30 Chorok Lee

We demonstrate a phenomenon of condensation of the Fourier transform $\widehat{f}$ of a function $f$ defined on the real line $\mathbb{R}$ which decreases rapidly on one half of the line. For instance, we prove that if $f$ is…

Complex Variables · Mathematics 2023-11-28 Bartosz Malman

Let $0 < \epsilon < 1/2$ be a noise parameter, and let $T_{\epsilon}$ be the noise operator acting on functions on the boolean cube $\{0,1\}^n$. Let $f$ be a nonnegative function on $\{0,1\}^n$. We upper bound the entropy of $T_{\epsilon}…

Information Theory · Computer Science 2016-06-23 Alex Samorodnitsky

The logarithmic coefficients $\gamma_n$ of an analytic and univalent function $f$ in the unit disk $\mathbb{D}=\{z\in\mathbb{C}:|z|<1\}$ with the normalization $f(0)=0=f'(0)-1$ is defined by $\log \frac{f(z)}{z}= 2\sum_{n=1}^{\infty}…

Complex Variables · Mathematics 2017-05-16 Md Firoz Ali , A. Vasudevarao

In this paper functions $f:D\to\mathbb{R}$ satisfying the inequality \[ f\Big(\frac{x+y}{2}\Big)\leq\frac12f(x)+\frac12f(y) +\varphi\Big(\frac{x-y}{2}\Big) \qquad(x,y\in D) \] are studied, where $D$ is a nonempty convex subset of a real…

Classical Analysis and ODEs · Mathematics 2024-12-10 Gábor Marcell Molnár , Zsolt Páles

Nisan and Szegedy (CC 1994) showed that any Boolean function $f:\{0,1\}^n\rightarrow \{0,1\}$ that depends on all its input variables, when represented as a real-valued multivariate polynomial $P(x_1,\ldots,x_n)$, has degree at least $\log…

Computational Complexity · Computer Science 2021-07-08 Srikanth Srinivasan , S. Venkitesh

``Behind every limit theorem, there is an inequality'' said Kolmogorov. We say ``for every inequality, there is an approximate inequality under approximate regularity conditions.'' Suppose $X, X'$ are independent and identically distributed…

Statistics Theory · Mathematics 2026-04-17 Manit Paul , Arun Kumar Kuchibhotla