Real-Time Decision Making 2018
2018-04-30..2018-05-04
Berkeley, United States
[Real-Time Decision Making, Real-Time Decision Making 2018]
[Real-Time Decision Making, Societal Networks 2018, Real-Time Decision Making Boot Camp, Spring 2018, Optimization and Decision-Making Under Uncertainty (Simons Institute, September 2016), Quantifying Uncertainty: Stochastic, Adversarial, and Beyond, Parallel and Distributed Algorithms for Inference and Optimization (Simons Institute, Oct. 21–24, 2013)]
who it's for
research scientists, control engineers, data engineers, transportation planners, network engineers, machine learning researchers, city operations managers
topics
online bid scaling algorithms; budget-constrained ad allocation; mechanism design with risk; selfish routing and diversity; traffic signal timing prediction; bike-sharing rebalancing incentives; fleet surge pricing and rebalancing; streaming matchings for graphs; sparse Fourier transform sensing; network clock synchronization; quantized control stabilization; mergeable summaries and sketches
| title | author | length |
|---|---|---|
| Google's AdWords Market: How Theory Influenced Practice | Vijay V. Vazirani | 40m |
Proposes a lightweight online bid scaling rule: multiply each bid by F(alpha)=1−e^{-(1−alpha)} where alpha is fraction of that advertiser’s budget spent, then… | ||
| Mechanism Design Beyond Risk Neutrality | Manolis Pountorakis | 38m |
Characterizes optimal single-item auctions when bidders are not risk neutral and gives concrete gains and limits: for a uniform[0,1] buyer a fixed reserve 1/2… | ||
| When Does Diversity of Agent Preferences Improve Outcomes in Selfish Routing | Evdokia Nikolova | 44m |
Shows that heterogeneity helps exactly for networks with a specific structure and gives tight constructions otherwise. Diversity always lowers total travel… | ||
| Predicting Intersection Signal Timing | Pravin Varaiya | 47m |
Claim: intersections are urban bottlenecks whose throughput and delay are set by cycle length, phase durations and offsets. Uses detector logs and historical… | ||
| Rebalancing in Bike-Sharing Systems – Incentives and Other Stories | David Shmoys | 43m |
Station performance is modeled with Poisson flows and each station as a continuous-time Markov chain so the cost is the expected number of stock-outs over the… | ||
| A Dashboard for Cities to Manage Fleets | Damon Wischik | 36m |
Proposes a Wardrop-style model where fleets set surge multiplier mu_i per origin, demand alpha_ij shifts, and empty-vehicle flows beta_ij rebalance so revenue… | ||
| On Learning Graph Binomial Distributions and Powers of Poisson Binomial Distributions | Dimitris Fotakis | 40m |
Presents concrete results: learn a Poisson binomial distribution up to total variation ε with sample complexity ~O((log(1/δ))/ε^2) by estimate mean and… | ||
| Streaming Algorithms for Matchings in Low Arboricity Graphs | Sofya Vorotnikova | 32m |
Provides an alpha+2 approximation to maximum matching size in graphs of arboricity alpha via three streaming algorithms: a dynamic-stream method using sampling… | ||
| Sparse Fourier Transform Algorithm for Real-Time Applications | Haitham Hassanieh | 44m |
Algorithms recover k large Fourier coefficients in k log N samples and k log N time for exact sparsity (approximate case at k log N samples and k log^2 N… | ||
| Self-Programming Networks: Network Clock Synchronization, Event Playback and Real-time Action | Balaji Prabhakar | 46m |
Claims that a NIC-based probe mesh (each server probing 10–15 random peers) plus accurate NIC timestamps and LASSO plus probe mesh reconstruction recovers… | ||
| Exact Minimum Number of Bits to Stabilize a Linear System | Victoria Kostina | 40m |
Proves the exact threshold for causal quantizers: the minimum number of quantization levels is minimum M = floor(A)+1 (so one bit suffices for 1<A<2) under IID… | ||
| An Informational Perspective on Uncertainty in Control | Gireeja Ranade | 49m |
Analyzes multiplicative uncertainty in actuation vs sensing, proving for scalar actuation noise BN IID that linear control is optimal for second-moment and… | ||
| Rerouting Flows when Links Fail | Jannik Matuschke | 41m |
Defines a formal model for single-link failures that maximizes flow subject to any one link going down and introduces the objective max-flow value at risk… | ||
| Broadcasting on Directed Acyclic Graphs | Yury Polyanskiy | 39m |
One-bit source propagates through a directed acyclic graph with edges as binary symmetric channels (IID Bernoulli δ) and nodes applying Boolean relay… | ||
| Learning What Works Best When | Swati Gupta | 42m |
Presents an algorithmic advance that computes exact projection via InFiX of separable convex functions onto submodular base polytopes, amortizing to O(n)… | ||
| Regularization, Perturbations, and Stability in Online Learning | Ambuj Tewari | 42m |
Shows that adding Gumbel perturbations to past losses yields sampling probabilities proportional to e^{-theta}, so FTPL with those perturbations is exactly the… | ||
| Limited Communication Gradient Methods for Distributed Resource Allocation Optimization | Na (Lina) Li | 43m |
Distributed dual-gradient methods can run with very low communication by broadcasting aggregate imbalance and quantized gradient directions: a one-bit… | ||
| A Bayesian Approach to Online Resource Allocation | Sid Banerjee | 40m |
Claims a simple policy that queries a black‑box simulator for the probability that accepting the current arrival reduces the offline optimum and then… | ||
| Mergeable Summaries and the Data Sketches Library | Edo Liberty | 42m |
Practical, production-ready C++/Java sketches for mergeable summaries and set membership: exact claims include an Alpha/Theta family that consistently beats… | ||
| Towards Verification of General Neural Networks: A Dual Approach | Krishnamurthy Dvijotham | 42m |
Poses verification as an optimization and uses a dual Lagrangian relaxation to upper‑bound worst‑case adversarial scores; proves NP‑hardness for even one… | ||
| Relative Error Tensor Low Rank Approximation | David P. Woodruff | 52m |
Shows an algorithm that outputs a rank R = O(K^2/ε^2) tensor achieving Frobenius (1+ε) relative error to the best rank-K solution, runs in input-sparsity time… | ||
| Integrating Functions via Distance Sensitive Hashing | Moses Charikar | 41m |
Claims a data structure that estimates partition-like sums z(y)=sum_x exp(phi(<x,y>)) faster than naive sampling: random sampling needs ~1/mu probes but this… | ||
| Active Regression via Linear-Sample Sparsification | Eric Price | 44m |
Shows that agnostic L2 regression on a d‑dimensional linear class needs only about kappa log d samples if points are drawn proportional to sup_F F(x)^2 (kappa… | ||
| nothing matches | ||