129 citations · 134 across the 7 of their papers we have counts for
7 papers
Reducing Marketplace Interference Bias Via Shadow Prices
Ido Bright, Arthur Delarue, Ilan Lobel
Marketplace companies rely heavily on experimentation when making changes to the design or operation of their platforms. The workhorse of experimentation is the randomized controll…
Classification of Spatio-Temporal Data via Asynchronous Sparse Sampling: Application to Flow Around a Cylinder
Ido Bright, Guang Lin, J. Nathan Kutz
We present a novel method for the classification and reconstruction of time dependent, high-dimensional data using sparse measurements, and apply it to the flow around a cylinder.…
Tight Bounds for Averaging Multi-Frequency Differential Inclusions, Applied to Control Systems
Ido Bright
We present new tight bounds for averaging differential inclusions, which we apply to multi-frequency inclusions consisting of a sum of time periodic set-valued mappings. For this f…
Compressive sensing and low-rank libraries for classification of bifurcation regimes in nonlinear dynamical systems
Steven L. Brunton, Jonathan H. Tu, Ido Bright +1
We show that for complex nonlinear systems, model reduction and compressive sensing strategies can be combined to great advantage for classifying, projecting, and reconstructing th…
A Note on Flux Integrals over Smooth Regular Domains
Ido Bright, John M. Lee
We provide new bounds on a flux integral over the portion of the boundary of one regular domain contained inside a second regular domain, based on properties of the second domain r…
Planar Infinite-Horizon Optimal Control Problems with Weighted Average Cost and Constraints, Applied to Cheeger Sets
Ido Bright
We establish a PoincarÈ-Bendixson type result for a weighted averaged infinite horizon problem in the plane, with and without averaged constraints. For the unconstrained problem, w…
A Short Proof that Minimal Sets of Planar Ordinary Differential Equations are Trivial
Ido Bright
We present a short proof, relaying on the divergence theorem, verifying that minimal sets in the plane are trivial.