Concept

Hyperplane

Related publications (15)

Finite Littlestone Dimension Implies Finite Information Complexity

Michael Christoph Gastpar, Aditya Pradeep, Ido Nachum

We prove that every online learnable class of functions of Littlestone dimension d admits a learning algorithm with finite information complexity. Towards this end, we use the notion of a globally stable algorithm. Generally, the information complexity of ...

2022

Fluctuation estimates for the multi-cell formula in stochastic homogenization of partitions

Matthias Ruf

In this paper we derive quantitative estimates in the context of stochastic homogenization for integral functionals defined on finite partitions, where the random surface integrand is assumed to be stationary. Requiring the integrand to satisfy in addition ...

2022

Geometry of the Loss Landscape in Overparameterized Neural Networks: Symmetries and Invariances

Wulfram Gerstner, Clément Hongler, Johanni Michael Brea, Francesco Spadaro, Berfin Simsek, Arthur Jacot

We study how permutation symmetries in overparameterized multi-layer neural networks generate `symmetry-induced' critical points. Assuming a network with

L

layers of minimal widths

r_1^*, \ldots, r_{L-1}^*

reaches a zero-loss minimum at $ r_1^*! \c ...

2021

A fast algorithm to find reduced hyperplane unit cells and solve N-dimensional Bezout's identities

Cyril Cayron

Deformation twinning on a plane is a simple shear that transforms a unit cell attached to the plane into another unit cell equivalent by mirror symmetry or 180 degrees rotation. Thus, crystallographic models of twinning require the determination of the sho ...

INT UNION CRYSTALLOGRAPHY2021

Affine Combination of Diffusion Strategies Over Networks

Ali H. Sayed, Jie Chen

Diffusion adaptation is a powerful strategy for distributed estimation and learning over networks. Motivated by the concept of combining adaptive filters, this work proposes a combination framework that aggregates the operation of multiple diffusion strate ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2020

From Tarski's Plank Problem to Simultaneous Approximation

János Pach, Andrei Kupavskii

A slab (or plank) is the part of the d-dimensional Euclidean space that lies between two parallel hyperplanes. The distance between the these hyperplanes is called the width of the slab. It is conjectured that the members of any infinite family of slabs wi ...

Mathematical Assoc Amer2017

New Moduli For Banach Spaces

Grigory Ivanov

Modifying the moduli of supporting convexity and supporting smoothness, we introduce new moduli for Banach spaces which occur, for example, as lengths of catheti of right-angled triangles (defined via so-called quasiorthogonality). These triangles have two ...

Tusi Mathematical Research Group2017

The number of double-normals in space

Andrei Kupavskii

Given a set V of points in , two points p, q from V form a double-normal pair, if the set V lies between two parallel hyperplanes that pass through p and q, respectively, and that are orthogonal to the segment pq. In this paper we study the maximum number ...

Springer2016

Signal structure: from manifolds to molecules and structured sparsity

Sofia Karygianni

Effective representation methods and proper signal priors are crucial in most signal processing applications. In this thesis we focus on different structured models and we design appropriate schemes that allow the discovery of low dimensional latent struct ...

EPFL2015

Local Barycentric Coordinates

Sofien Bouaziz, Bailin Deng

Barycentric coordinates yield a powerful and yet simple paradigm to interpolate data values on polyhedral domains. They represent interior points of the domain as an affine combination of a set of control points, defining an interpolation scheme for any fu ...

2014

Optimal Sampling Rates in Infinite-Dimensional Compressed Sensing

Martin Vetterli, Loïc Arnaud Baboulaz, Mitra Fatemi

The theory of compressed sensing studies the problem of recovering a high dimensional sparse vector from its projections onto lower dimensional subspaces. The recently introduced framework of infinite-dimensional compressed sensing [1], to some extent gene ...

2013

Low-rank Matrix Approximation Using Point-wise Operators

Arash Amini, Amin Karbasi

Extracting low dimensional structure from high dimensional data arises in many applications such as machine learning, statistical pattern recognition, wireless sensor networks, and data compression. If the data is restricted to a lower dimensional subspace ...

Institute of Electrical and Electronics Engineers2012

New Results in the Theory of Linear and Integer Programming

Nicolai Hähnle

The polynomial Hirsch conjecture states that the vertex-edge diameter of a d-dimensional polyhedron with n facets is bounded by a polynomial in d and n. For the special case where the polyhedron is defined as the set of points satisfying a system Ax ≤ b of ...

EPFL2012

Linear Manifold Approximation based on Differences of Tangents

Pascal Frossard, Sofia Karygianni

In this paper, we consider the problem of manifold approximation with affine subspaces. Our objective is to discover a set of low dimensional affine subspaces that represents manifold data accurately while preserving the manifold’s structure. For this purp ...

2011

A Note On The Dai-Singleton Canonical Representation Of Affine Term Structure Models

Damir Filipovic

Dai and Singleton (2000) study a class of term structure models for interest rates that specify the short rate as an affine combination of the components of an N-dimensional affine diffusion process. Observable quantities in such models are invariant under ...

Wiley-Blackwell2010