A Polynomial Regularity Lemma For Semialgebraic Hypergraphs And Its Applications In Geometry And Property Testing

In this paper, we prove several extremal results for geometrically defined hypergraphs. In particular, we establish an improved lower bound, single exponentially decreasing in k, on the best constant delta > 0 such that the vertex classes P-1,...,P-k of every k -partite k -uniform semialgebraic hypergraph H = (P-1 U center dot center dot center dot U P-k, E) with vertical bar E vertical bar >= epsilon ll(j=1)(k) vertical bar P-i vertical bar have, for 1

Efficient Continual Finite-Sum Minimization

Volkan Cevher, Efstratios Panteleimon Skoulakis, Leello Tadesse Dadi

Given a sequence of functions

f_1,\ldots,f_n

with

f_i:\mathcal{D}\mapsto \mathbb{R}

, finite-sum minimization seeks a point

{x}^\star \in \mathcal{D}

minimizing

\sum_{j=1}^nf_j(x)/n

. In this work, we propose a key twist into the finite-sum minimizat ...

2024

A Polynomial Regularity Lemma For Semialgebraic Hypergraphs And Its Applications In Geometry And Property Testing

Graph Chatbot

Graph generative deep learning models with an application to circuit topologies

Efficient Continual Finite-Sum Minimization

Reactive collision-free motion generation in joint space via dynamical systems and sampling-based MPC

Graph generative deep learning models with an application to circuit topologies

Efficient Continual Finite-Sum Minimization

Reactive collision-free motion generation in joint space via dynamical systems and sampling-based MPC