A survey on approximate edge AI for energy efficient autonomous driving services
Autonomous driving services depends on active sensing from modules such as camera,
LiDAR, radar, and communication units. Traditionally, these modules process the sensed …
LiDAR, radar, and communication units. Traditionally, these modules process the sensed …
Learning to optimize: A primer and a benchmark
Learning to optimize (L2O) is an emerging approach that leverages machine learning to
develop optimization methods, aiming at reducing the laborious iterations of hand …
develop optimization methods, aiming at reducing the laborious iterations of hand …
[HTML][HTML] Adaptive approximate computing in edge AI and IoT applications: A review
Recent advancements in hardware and software systems have been driven by the
deployment of emerging smart health and mobility applications. These developments have …
deployment of emerging smart health and mobility applications. These developments have …
Optimal robustness-consistency trade-offs for learning-augmented online algorithms
We study the problem of improving the performance of online algorithms by incorporating
machine-learned predictions. The goal is to design algorithms that are both consistent and …
machine-learned predictions. The goal is to design algorithms that are both consistent and …
Secretaries with advice
The secretary problem is probably the purest model of decision making under uncertainty. In
this paper we ask which advice can we give the algorithm to improve its success probability …
this paper we ask which advice can we give the algorithm to improve its success probability …
Online algorithms with multiple predictions
This paper studies online algorithms augmented with multiple machine-learned predictions.
We give a generic algorithmic framework for online covering problems with multiple …
We give a generic algorithmic framework for online covering problems with multiple …
Online graph algorithms with predictions
Online algorithms with predictions is a popular and elegant framework for bypassing
pessimistic lower bounds in competitive analysis. In this model, online algorithms are …
pessimistic lower bounds in competitive analysis. In this model, online algorithms are …
Instance-optimal compressed sensing via posterior sampling
We characterize the measurement complexity of compressed sensing of signals drawn from
a known prior distribution, even when the support of the prior is the entire space (rather than …
a known prior distribution, even when the support of the prior is the entire space (rather than …
Improved frequency estimation algorithms with and without predictions
Estimating frequencies of elements appearing in a data stream is a key task in large-scale
data analysis. Popular sketching approaches to this problem (eg, CountMin and …
data analysis. Popular sketching approaches to this problem (eg, CountMin and …
Recent and upcoming developments in randomized numerical linear algebra for machine learning
Large matrices arise in many machine learning and data analysis applications, including as
representations of datasets, graphs, model weights, and first and second-order derivatives …
representations of datasets, graphs, model weights, and first and second-order derivatives …