Garud Iyengar

Orcid: 0000-0001-6546-4154

Affiliations:
  • Columbia University, New York City, USA


According to our database1, Garud Iyengar authored at least 73 papers between 1998 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Model-Free Approximate Bayesian Learning for Large-Scale Conversion Funnel Optimization.
CoRR, 2024

2023
Economics of Permissioned Blockchain Adoption.
Manag. Sci., June, 2023

Robust Inventory Management: A Cycle-Based Approach.
Manuf. Serv. Oper. Manag., March, 2023

Scalable Computation of Causal Bounds.
J. Mach. Learn. Res., 2023

Decentralized Finance: Protocols, Risks, and Governance.
Found. Trends Priv. Secur., 2023

A Doubly Robust Approach to Sparse Reinforcement Learning.
CoRR, 2023

Optimizer's Information Criterion: Dissecting and Correcting Bias in Data-Driven Optimization.
CoRR, 2023

Pareto Front Identification with Regret Minimization.
CoRR, 2023

Causal Bounds in Quasi-Markovian Graphs.
Proceedings of the International Conference on Machine Learning, 2023

Improved Algorithms for Multi-period Multi-class Packing Problems with Bandit Feedback.
Proceedings of the International Conference on Machine Learning, 2023

Hedging against Complexity: Distributionally Robust Optimization with Parametric Approximation.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2023

2022
Shapley Meets Uniform: An Axiomatic Framework for Attribution in Online Advertising.
Manag. Sci., 2022

Online Assortment Optimization with Reusable Resources.
Manag. Sci., 2022

Distributionally Robust End-to-End Portfolio Construction.
CoRR, 2022

2021
Multiregional Oligopoly with Capacity Constraints.
Manag. Sci., 2021

Asymptotically Optimal Competitive Ratio for Online Allocation of Reusable Resources.
Proceedings of the Web and Internet Economics - 17th International Conference, 2021

Sparsity-Agnostic Lasso Bandit.
Proceedings of the 38th International Conference on Machine Learning, 2021

Multinomial Logit Contextual Bandits: Provable Optimality and Practicality.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
Distributionally Robust Mechanism Design.
Manag. Sci., 2020

Online Allocation of Reusable Resources via Algorithms Guided by Fluid Approximations.
CoRR, 2020

Online Allocation of Reusable Resources: Achieving Optimal Competitive Ratio.
CoRR, 2020

2019
A One-Third Advice Rule Based on a Control-Theoretic Opinion Dynamics Model.
IEEE Trans. Comput. Soc. Syst., 2019

Thompson Sampling for Multinomial Logit Contextual Bandits.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Sequential Anomaly Detection using Inverse Reinforcement Learning.
Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, 2019

Personalized Product Recommendation for Interactive Media.
Proceedings of the Intelligent Human Systems Integration 2019, 2019

Deep Influence Diagrams: An Interpretable and Robust Decision Support System.
Proceedings of the Business Information Systems - 22nd International Conference, 2019

2018
Social Influence Makes Self-Interested Crowds Smarter: An Optimal Control Perspective.
IEEE Trans. Comput. Soc. Syst., 2018

Passive Reaction Analysis for Grasp Stability.
IEEE Trans Autom. Sci. Eng., 2018

Resource cost aware scheduling.
Eur. J. Oper. Res., 2018

Directed Exploration in PAC Model-Free Reinforcement Learning.
CoRR, 2018

Attainment Ratings for Graph-Query Recommendation.
CoRR, 2018

Robust Implicit Backpropagation.
CoRR, 2018

Unbiased scalable softmax optimization.
CoRR, 2018

Passive Static Equilibrium with Frictional Contacts and Application to Grasp Stability Analysis.
Proceedings of the Robotics: Science and Systems XIV, 2018

Interpretable Robust Decision Making.
Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018

2017
Modeling Multimodal Continuous Heterogeneity in Conjoint Analysis - A Sparse Learning Approach.
Mark. Sci., 2017

Linear Convergence of Stochastic Frank Wolfe Variants.
Proceedings of the 20th International Conference on Artificial Intelligence and Statistics, 2017

2016
A Near-Optimal Maintenance Policy for Automated DR Devices.
IEEE Trans. Smart Grid, 2016

Tax-Aware Dynamic Asset Allocation.
Oper. Res., 2016

On the Distinction between Active and Passive Reaction in Grasp Stability Analysis.
Proceedings of the Algorithmic Foundations of Robotics XII, 2016

2015
Portfolio Selection with Multiple Spectral Risk Constraints.
SIAM J. Financial Math., 2015

Efficient "Shotgun" Inference of Neural Connectivity from Highly Sub-sampled Activity Data.
PLoS Comput. Biol., 2015

An alternating direction method with increasing penalty for stable principal component pursuit.
Comput. Optim. Appl., 2015

An Asynchronous Distributed Proximal Gradient Method for Composite Convex Optimization.
Proceedings of the 32nd International Conference on Machine Learning, 2015

2014
A unified approach for minimizing composite norms.
Math. Program., 2014

Optimal price rebates for demand response under power flow constraints.
Proceedings of the 2014 IEEE International Conference on Smart Grid Communications, 2014

2013
Single machine scheduling with job-dependent convex cost and arbitrary precedence constraints.
Oper. Res. Lett., 2013

An Axiomatic Approach to Systemic Risk.
Manag. Sci., 2013

Fast gradient descent method for Mean-CVaR optimization.
Ann. Oper. Res., 2013

Near-optimal execution policies for demand-response contracts in electricity markets.
Proceedings of the 52nd IEEE Conference on Decision and Control, 2013

2012
A First-Order Augmented Lagrangian Method for Compressed Sensing.
SIAM J. Optim., 2012

2011
Approximating Semidefinite Packing Programs.
SIAM J. Optim., 2011

A First-Order Smoothed Penalty Method for Compressed Sensing.
SIAM J. Optim., 2011

Inequality and network structure.
Games Econ. Behav., 2011

Energy Aware Scheduling for Weighted Completion Time and Weighted Tardiness
CoRR, 2011

2010
Feasible and Accurate Algorithms for Covering Semidefinite Programs.
Proceedings of the Algorithm Theory, 2010

2007
On two-stage convex chance constrained problems.
Math. Methods Oper. Res., 2007

Models of malicious behavior in sponsored search.
Proceedings of the 2007 Spring Simulation Multiconference, 2007

An equilibrium model for matching impatient demand and patient supply over time.
Proceedings of the Proceedings 8th ACM Conference on Electronic Commerce (EC-2007), 2007

2006
An Active Set Method for Single-Cone Second-Order Cone Programs.
SIAM J. Optim., 2006

Approximating Fractional Packings and Coverings in O(1/epsilon) Iterations.
SIAM J. Comput., 2006

Ambiguous chance constrained problems and robust optimization.
Math. Program., 2006

Characterizing Optimal Adword Auctions
CoRR, 2006

2005
Inverse conic programming with applications.
Oper. Res. Lett., 2005

Cuts for mixed 0-1 conic programming.
Math. Program., 2005

Robust Dynamic Programming.
Math. Oper. Res., 2005

Approximation Algorithms for Semidefinite Packing Problems with Applications to Maxcut and Graph Coloring.
Proceedings of the Integer Programming and Combinatorial Optimization, 2005

2004
Solving fractional packing problems in <i>O</i><sup>ast</sup>(1/?) iterations.
Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004

2003
Robust convex quadratically constrained programs.
Math. Program., 2003

Robust Portfolio Selection Problems.
Math. Oper. Res., 2003

2001
Cutting Planes for Mixed 0-1 Semidefinite Programs.
Proceedings of the Integer Programming and Combinatorial Optimization, 2001

2000
Growth optimal investment in horse race markets with costs.
IEEE Trans. Inf. Theory, 2000

1998
A new method of channel shortening with applications to discrete multi-tone (DMT) systems.
Proceedings of the 1998 IEEE International Conference on Communications, 1998


  Loading...