
Understanding Impacts of HighOrder Loss Approximations and Features in Deep Learning Interpretation
Current methods to interpret deep learning models by generating saliency...
read it

The Price of Information in Combinatorial Optimization
Consider a network design application where we wish to lay down a minimu...
read it

Prophet Secretary for Combinatorial Auctions and Matroids
The secretary and the prophet inequality problems are central to the fie...
read it

Optimal Online Contention Resolution Schemes via ExAnte Prophet Inequalities
Online contention resolution schemes (OCRSs) were proposed by Feldman, S...
read it

Prepare for the Expected Worst: Algorithms for Reconfigurable Resources Under Uncertainty
In this paper we study how to optimally balance cheap inflexible resourc...
read it

(Near) Optimal Adaptivity Gaps for Stochastic MultiValue Probing
Consider a kidneyexchange application where we want to find a maxmatch...
read it

Robustness Certificates Against Adversarial Examples for ReLU Networks
While neural networks have achieved high performance in different learni...
read it

The Markovian Price of Information
Suppose there are n Markov chains and we need to pay a perstep price to...
read it

Certifiably Robust Interpretation in Deep Learning
Although gradientbased saliency maps are popular methods for deep learn...
read it

Nonclairvoyant Precedence Constrained Scheduling
We consider the online problem of scheduling jobs on identical machines,...
read it

Approximation Schemes for a Buyer with Independent Items via Symmetries
We consider a revenuemaximizing seller with n items facing a single buy...
read it

Robust Algorithms for the Secretary Problem
In classical secretary problems, a sequence of n elements arrive in a un...
read it

Bounding Singular Values of Convolution Layers
In deep neural networks, the spectral norm of the Jacobian of a layer bo...
read it

Improved Truthful Mechanisms for Combinatorial Auctions with Submodular Bidders
A longstanding open problem in Algorithmic Mechanism Design is to design...
read it

Algorithms and Adaptivity Gaps for Stochastic kTSP
Given a metric (V,d) and a root∈ V, the classic kTSP problem is to find...
read it

Faster Matroid Intersection
In this paper we consider the classic matroid intersection problem: give...
read it

Online Geometric Discrepancy for Stochastic Arrivals with Applications to Envy Minimization
Consider a unit interval [0,1] in which n points arrive onebyone indep...
read it

Online Vector Balancing and Geometric Discrepancy
We consider an online vector balancing question where T vectors, chosen ...
read it

Prophet Inequalities with Linear Correlations and Augmentations
In a classical online decision problem, a decisionmaker who is trying t...
read it

RandomOrder Models
This chapter introduces the randomorder model in online algorithms. In ...
read it
Sahil Singla
is this you? claim profile