Real-Time Decision Making
2016-07-01
Berkeley, United States
[Real-Time Decision Making, Real-Time Decision Making 2018]
[Real-Time Decision Making 2018, Real-Time Decision Making Boot Camp, Spring 2018, Societal Networks 2018, Optimization and Decision-Making Under Uncertainty (Simons Institute, September 2016), Parallel and Distributed Algorithms for Inference and Optimization (Simons Institute, Oct. 21–24, 2013), Learning, Algorithm Design and Beyond Worst-Case Analysis]
who it's for
algorithm designers, data engineers, machine learning engineers, control engineers, distributed systems engineers, robotics and drone engineers, operations researchers
topics
real-time convex optimization; coresets for online tracking; streaming heavy hitters algorithms; smartphone earthquake detection pipeline; low-latency astronomical pipelines; interactive coding for noisy channels; distributed learning in routing games; online optimal power flow algorithms; dynamic pricing for ridesharing; clock synchronization for cyber-physical systems; mean-variance path optimization; local computation algorithms
| title | author | length |
|---|---|---|
| Physics at the LHC: Data Analysis and Global Network Challenges with Exascale Data | Harvey Newman | 01h 07m |
Large LHC datasets arrive at 40 MHz crossings with up to ~30 interactions now and 140–200 planned for the HL‑LHC, read out by 100 million channels every 25 ns… | ||
| Warning When You Need It: Earthquakes and Smartphones | Richard Allen | 01h 01m |
Demonstrates a working West Coast warning pipeline (ShakeAlert proven technology) plus a research-grade phone sensor network (MyShake smartphone network) that… | ||
| Real-Time Convex Optimization | Stephen Boyd | 26m |
Claims that convex problems (especially QPs) run in 50 microseconds on small embedded hardware and that automatic compilation to cone programs plus code… | ||
| Coding for Interactive Communication | Leonard J. Schulman | 57m |
Describes concrete interactive coding results: any T-step interactive protocol can be simulated with only a constant-rate overhead using either randomized… | ||
| Crowdsourcing for Clustering: Algorithms and Information-Theoretic Lower Bounds | Babak Hassibi | 47m |
Uses a low-rank plus sparse convex program (nuclear norm + L1) to recover cluster blocks from partially observed stochastic block graphs, proves success… | ||
| Local Computation Algorithms | Ronitt Rubinfeld | 38m |
Defines a formal model where an algorithm answers queries about pieces of a huge output without computing the whole output, proving that many tasks admit… | ||
| What Does `Real Time' Mean | Edward A. Lee | 55m |
Argues that real time means tying computation to physical time and gives concrete work: clock sync with CERN White Rabbit to ~80 picoseconds, a Bosch Rexroth… | ||
| The Palomar Transient Factory | Peter Nugent | 54m |
The Palomar Transient Factory builds a real-time pipeline that moves 250 MB/min (≈100 GB/night) from a 92 MP camera through image subtraction to a database… | ||
| Market Dynamics of Best-Response with Lookahead | Yuval Rabani | 41m |
Shows that price updates where each seller uses level-K lookahead best responses in Fisher markets with elastic bounded demand form monotone, strictly… | ||
| Algorithms for Risk Mitigation in Networks | Evdokia Nikolova | 58m |
Uncertainty forces new algorithms: minimizing a mean+standard-deviation objective is nonadditive so optimal substructure fails, but projecting paths to the… | ||
| Core-sets for Real-Time Tracking using Caratheodory Theorem, with Applications to Drones | Dan Feldman | 47m |
Proposes concrete, implementable coresets that compress point clouds so online pose-fitting and k‑segment trajectory compression run in milliseconds: a… | ||
| Closed-Loop Control of Network Processes | John Tsitsiklis | 35m |
Presents a closed‑loop treatment of the SIS epidemic on a graph, modeling infections as a SIS continuous-time Markov chain and curing as a reallocatable… | ||
| Distributed Learning Dynamics Convergence in Routing Games | Alexandre Bayen | 48m |
Shows that route-choice dynamics either oscillate or converge depending on the learning rule, with three concrete results: no-regret yields only average… | ||
| Increasing Throughput in Urban Roads by Connected Vehicles | Pravin Varaiya | 37m |
Claims that using connected vehicles and adaptive cruise control to form platoons raises intersection saturation from ~1,200 vph per lane to as much as 4,800… | ||
| Seeing Real-Time Traffic Problems | Damon Wischik | 44m |
Phones trade cheap and fast sensors for noisy, preprocessed positions: iOS often latches a single wrong coordinate after internal Kalman smoothing, Android… | ||
| Sub-Quadratic Recovery of Correlated Pairs | Graham Cormode | 43m |
Claims a sub-quadratic algorithm (n^{2−δ} with small δ) for finding few strong correlated pairs using inner-product-preserving sketches and random grouping… | ||
| Optimal Power Flow: Relaxation, Online Algorithm, Fast Dynamics | Steven Low | 53m |
Shows that SDP and much cheaper SOCP relaxations turn AC optimal power flow into convex problems and that SOCP exact on radial grids under a half‑plane phase… | ||
| Distributed Control for Demand Dispatch | Sean Meyn | 49m |
Explains a concrete control recipe for “demand dispatch”: design randomized control laws and a local pre-filtering stage so millions of on/off loads… | ||
| Algorithmic Aspects of Online Advertising | Amin Saberi | 38m |
Defines the online budgeted ad-allocation (AdWords) model, proves greedy can be as bad as 1/2 worst-case and gives a multiplicative pacing algorithm that… | ||
| Smarter Tools for (Citi)Bike-Sharing | David Shmoys | 57m |
City bike data (≈7,000 bikes, 14.5k docks, ≈400 stations, 1.2M trips/month) drives a model that minimizes expected unhappy users (arrive-to-rent with no bike… | ||
| Dynamic Pricing in Ridesharing Platforms | Siddhartha Banerjee | 55m |
Argues that fine-grained surge pricing is modeled with a Jackson network model and a simple threshold state pricing rule that sets fares based on instantaneous… | ||
| When Computing Time is Time Lost | Sampath Kannan | 37m |
Two theoretical models appear: one designs fast timers that decide whether a heuristic will exceed a deadline by testing the actual input, the other treats… | ||
| Real-Time Decision Making in Hybrid Systems | Claire Tomlin | 57m |
Computes conservative safety envelopes via a backwards reachable set (HJ-Isaacs PDE) and runs real-time 3D solves on a laptop; decomposes a 10-D quadrotor… | ||
| Predicting from Noisy and Incomplete Data: Some Perspectives from Computational Learning Theory | Rocco A. Servedio | 48m |
Survey claims: PAC learning is often computationally hard, so the field studies agnostic and restricted-distribution settings and gets concrete algorithms and… | ||
| Approximate Optimality with Bounded Regret in Dynamic Matching Models | Ana Bušić | 45m |
Proves that, under paired arrivals and a single critical bottleneck, a constructed H-max-weight with threshold policy achieves asymptotic optimality with… | ||
| Localization and Nonmetric Multidimensional Scaling via Paired Comparisons | Mark Davenport | 39m |
Estimates a Euclidean vector X from binary one-bit measurements that compare which of two known points is closer, models paired comparisons as Gaussian random… | ||
| New Algorithms for Heavy Hitters in Data Streams | David P. Woodruff | 01h 04m |
One-pass algorithm finds L2 heavy hitters in insertion-only streams using nearly log N bits of space (previous best was ~log^2 N), giving an optimal bound… | ||
| nothing matches | ||