paper-with-me

Papers

Generalized Outer Bounds on the Finite Geometric Sum of Ellipsoids

2020-06-15 · Navid Hashemi, Justin Ruths

General results on convex bodies are reviewed and used to derive an exact closed-form parametric formula for the boundary of the geometric (Minkowski) sum of $k$ ellipsoids in $n$-dimensional Euclidean space. Previously this was done through iterative algorithms in which each new ellipsoid was added to an ellipsoid approximation of the sum of the previous ellipsoids. Here we provide one shot formulas to add $k$ ellipsoids directly with no intermediate approximations required. This allows us to observe a new degree of freedom in the family of ellipsoidal bounds on the geometric sum. We demonstrate an application of these tools to compute the reachable set of a discrete-time dynamical system.

📄 PDF Abstract BibTeX arXiv:2006.08739

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Finite Sample Analysis of Distribution-Free Confidence Ellipsoids for Linear Regression

2024-09-13 · Szabolcs Szentpéteri, Balázs Csanád Csáji

The least squares (LS) estimate is the archetypical solution of linear regression problems. The asymptotic Gaussianity of the scaled LS error is often used to construct approximate confidence ellipsoids around the LS est…

regression

Distributed outer approximation of the intersection of ellipsoids

2023-05-24 · Rodrigo Aldana-Lopez, Eduardo Sebastian, Rosario Aragues, Eduardo Montijano 외

The outer Lowner-John method is widely used in sensor fusion applications to find the smallest ellipsoid that can approximate the intersection of a set of ellipsoids, described by positive definite covariance matrices mo…

Sensor Fusion

Distribution-Free Confidence Ellipsoids for Ridge Regression with PAC Bounds

2026-01-19 · Szabolcs Szentpéteri, Balázs Csanád Csáji arxiv

Linearly parametrized models are widely used in control and signal processing, with the least-squares (LS) estimate being the archetypical solution. When the input is insufficiently exciting, the LS problem may be unsolv…

Sample Complexity of the Sign-Perturbed Sums Method

2024-09-02 · Szabolcs Szentpéteri, Balázs Csanád Csáji

We study the sample complexity of the Sign-Perturbed Sums (SPS) method, which constructs exact, non-asymptotic confidence regions for the true system parameters under mild statistical assumptions, such as independent and…

regression

Finite-Time Queue Peak Laws in Stochastic Networks: Logarithmic Scaling After Geometric Thresholds

2026-06-16 · Hao Liang, Cheng Tang, Yunzong Xu arxiv

We study finite-horizon queue peaks in generalized switches, a standard stochastic-network model in which many queues share constrained service resources. Arrivals may be dependent, nonstationary, and responsive to the s…