Related papers: Optimal Oracles for Point-to-Set Principles

Partitioning oracles were introduced by Hassidim et al. (FOCS 2009) as a generic tool for constant-time algorithms. For any epsilon > 0, a partitioning oracle provides query access to a fixed partition of the input bounded-degree minor-free…

Given $E \subset \mathbb{R}^d$, $d \ge 2$, define ${\mathcal D}(E) \equiv {(x-y)/|x-y|: x,y \in E} \subset S^{d-1},$ the set of directions determined by $E$. We prove that if the Hausdorff dimension of $E$ is greater than $d-1$, then…

We consider an adaptive finite element method with arbitrary but fixed polynomial degree $p \ge 1$, where adaptivity is driven by an edge-based residual error estimator. Based on the modified maximum criterion from [Diening et al, Found.…

The efficient optimization method for locally Lipschitz continuous multiobjective optimization problems from [1] is extended from finite-dimensional problems to general Hilbert spaces. The method iteratively computes Pareto critical points,…

We establish Marstrand-type as well as Besicovich-Federer-type projection theorems for closest-point projections onto hyperplanes in the normed space $\mathbb{R}^{n}$. In particular, we prove that if a norm on $\mathbb{R}^{n}$ is…

In this dissertation we define a generalization of Kakeya sets in certain metric spaces. Kakeya sets in Euclidean spaces are sets of zero Lebesgue measure containing a segment of length one in every direction. A famous conjecture, known as…

Orbit-finite models of computation generalise the standard models of computation, to allow computation over infinite objects that are finite up to symmetries on atoms, denoted by $\mathbb{A}$. Set theory with atoms is used to reason about…

We describe how to implement the conformal bootstrap program in the context of the embedding space OPE formalism introduced in previous work. To take maximal advantage of the known properties of the scalar conformal blocks for…

By introducing a ubiquity property for rectangles, we prove the mass transference principle from rectangles to rectangles, i.e., if a sequence of rectangles forms a ubiquity system (a full measure property), then the limsup set defined by…

We consider minimizing a smooth and strongly convex objective function using a stochastic Newton method. At each iteration, the algorithm is given an oracle access to a stochastic estimate of the Hessian matrix. The oracle model includes…

Let $\theta$ be an irrational number and $\varphi: {\mathbb N} \to {\mathbb R}^{+}$ be a monotone decreasing function tending to zero. Let $$E_\varphi(\theta) =\Big\{y \in \mathbb R: \|n\theta- y\|<\varphi(n), \ {\text{for infinitely…

In this paper, we propose a systematic approach for extending first-order optimization algorithms, originally designed for unconstrained strongly convex problems, to handle closed and convex set constraints. We show that the resulting…

This paper contains two results on the dimension and smoothness of radial projections of sets and measures in Euclidean spaces. To introduce the first one, assume that $E,K \subset \mathbb{R}^{2}$ are non-empty Borel sets with…

Pirashvili's Dold-Kan type theorem for finite pointed sets follows from the identification in terms of surjections of the morphisms between the tensor powers of a functor playing the role of the augmentation ideal; these functors are…

This paper investigates a refinement of Marstrand's projection theorem; more specifically, let $\Pi_t, t\in[0,1]$ be a family of $m$ dimensional subspaces of the Euclidean space $\mathbb{R}^n$ and let $P_t:\mathbb{R}^4\mapsto \Pi_t$ be the…

Let $F \subset \mathbb{R}^{2}$, and let $\dim_{\mathrm{A}}$ stand for Assouad dimension. I prove that $\dim_{\mathrm{A}} \pi_{e}(F) \geq \min\{\dim_{\mathrm{A}} F,1\}$ for all $e \in S^{1}$ outside of a set of Hausdorff dimension zero. This…

For $\alpha$ in $(0,1]$, a subset $E$ of $\RR$ is called Furstenberg set of type $\alpha$ or $F_\alpha$-set if for each direction $e$ in the unit circle there is a line segment $\ell_e$ in the direction of $e$ such that the Hausdorff…

We show that linear inequalities for entropies have a natural geometric interpretation in terms of Hausdorff and packing dimensions, using the point-to-set principle and known results about inequalities for complexities, entropies and the…

This work introduces the nested-set Hessian approximation, a second-order approximation method that can be used in any derivative-free optimization routine that requires such information. It is built on the foundation of the generalized…

In experimental design, we are given $n$ vectors in $d$ dimensions, and our goal is to select $k\ll n$ of them to perform expensive measurements, e.g., to obtain labels/responses, for a linear regression task. Many statistical criteria have…