![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Garud Iyengar
Person information
- affiliation: Columbia University, New York City, USA
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c27]Wonyoung Kim, Garud Iyengar, Assaf Zeevi:
A Doubly Robust Approach to Sparse Reinforcement Learning. AISTATS 2024: 2305-2313 - [i25]Garud Iyengar, Raghav Singal:
Model-Free Approximate Bayesian Learning for Large-Scale Conversion Funnel Optimization. CoRR abs/2401.06710 (2024) - [i24]Jakub Cerný, Chun Kai Ling, Christian Kroer, Garud Iyengar:
Layered Graph Security Games. CoRR abs/2405.03070 (2024) - 2023
- [j36]Agostino Capponi, Garud Iyengar, Jay Sethuraman:
Decentralized Finance: Protocols, Risks, and Governance. Found. Trends Priv. Secur. 5(3): 144-188 (2023) - [j35]Madhumitha Shridharan, Garud Iyengar:
Scalable Computation of Causal Bounds. J. Mach. Learn. Res. 24: 237:1-237:35 (2023) - [j34]Garud Iyengar
, Fahad Saleh
, Jay Sethuraman
, Wenjun Wang
:
Economics of Permissioned Blockchain Adoption. Manag. Sci. 69(6): 3415-3436 (2023) - [j33]Yupeng Chen
, Garud Iyengar
, Chun Wang
:
Robust Inventory Management: A Cycle-Based Approach. Manuf. Serv. Oper. Manag. 25(2): 581-594 (2023) - [c26]Garud Iyengar, Henry Lam, Tianyu Wang:
Hedging against Complexity: Distributionally Robust Optimization with Parametric Approximation. AISTATS 2023: 9976-10011 - [c25]Wonyoung Kim, Garud Iyengar, Assaf Zeevi:
Improved Algorithms for Multi-period Multi-class Packing Problems with Bandit Feedback. ICML 2023: 16458-16501 - [c24]Madhumitha Shridharan, Garud Iyengar:
Causal Bounds in Quasi-Markovian Graphs. ICML 2023: 31675-31692 - [i23]Wonyoung Kim, Garud Iyengar, Assaf Zeevi:
Improved Algorithms for Multi-period Multi-class Packing Problems with~Bandit~Feedback. CoRR abs/2301.13791 (2023) - [i22]Wonyoung Kim, Garud Iyengar, Assaf Zeevi:
Pareto Front Identification with Regret Minimization. CoRR abs/2306.00096 (2023) - [i21]Garud Iyengar, Henry Lam, Tianyu Wang:
Optimizer's Information Criterion: Dissecting and Correcting Bias in Data-Driven Optimization. CoRR abs/2306.10081 (2023) - [i20]Madhumitha Shridharan, Garud Iyengar:
Scalable Computation of Causal Bounds. CoRR abs/2308.02709 (2023) - [i19]Wonyoung Kim, Garud Iyengar, Assaf Zeevi:
A Doubly Robust Approach to Sparse Reinforcement Learning. CoRR abs/2310.15286 (2023) - [i18]Agostino Capponi, Garud Iyengar, Jay Sethuraman:
Decentralized Finance: Protocols, Risks, and Governance. CoRR abs/2312.01018 (2023) - 2022
- [j32]Xiao-Yue Gong, Vineet Goyal
, Garud N. Iyengar
, David Simchi-Levi, Rajan Udwani
, Shuangyu Wang:
Online Assortment Optimization with Reusable Resources. Manag. Sci. 68(7): 4772-4785 (2022) - [j31]Raghav Singal
, Omar Besbes
, Antoine Désir
, Vineet Goyal
, Garud Iyengar
:
Shapley Meets Uniform: An Axiomatic Framework for Attribution in Online Advertising. Manag. Sci. 68(10): 7457-7479 (2022) - [c23]Madhumitha Shridharan, Garud Iyengar:
Scalable Computation of Causal Bounds. ICML 2022: 20125-20140 - [i17]Giorgio Costa, Garud N. Iyengar:
Distributionally Robust End-to-End Portfolio Construction. CoRR abs/2206.05134 (2022) - [i16]Garud Iyengar, Henry Lam, Tianyu Wang:
Hedging against Complexity: Distributionally Robust Optimization with Parametric Approximation. CoRR abs/2212.01518 (2022) - 2021
- [j30]Humoud Alsabah
, Benjamin Bernard
, Agostino Capponi
, Garud Iyengar
, Jay Sethuraman
:
Multiregional Oligopoly with Capacity Constraints. Manag. Sci. 67(8): 4789-4808 (2021) - [c22]Min-hwan Oh, Garud Iyengar:
Multinomial Logit Contextual Bandits: Provable Optimality and Practicality. AAAI 2021: 9205-9213 - [c21]Min-hwan Oh, Garud Iyengar, Assaf Zeevi:
Sparsity-Agnostic Lasso Bandit. ICML 2021: 8271-8280 - [c20]Vineet Goyal, Garud Iyengar, Rajan Udwani:
Asymptotically Optimal Competitive Ratio for Online Allocation of Reusable Resources. WINE 2021: 543 - [i15]Min-hwan Oh, Garud Iyengar:
Multinomial Logit Contextual Bandits: Provable Optimality and Practicality. CoRR abs/2103.13929 (2021) - 2020
- [j29]Çagil Koçyigit, Garud Iyengar
, Daniel Kuhn
, Wolfram Wiesemann
:
Distributionally Robust Mechanism Design. Manag. Sci. 66(1): 159-189 (2020) - [i14]Vineet Goyal, Garud Iyengar, Rajan Udwani:
Online Allocation of Reusable Resources: Achieving Optimal Competitive Ratio. CoRR abs/2002.02430 (2020) - [i13]Min-hwan Oh, Garud Iyengar:
Sequential Anomaly Detection using Inverse Reinforcement Learning. CoRR abs/2004.10398 (2020) - [i12]Min-hwan Oh, Garud Iyengar, Assaf Zeevi:
Sparsity-Agnostic Lasso Bandit. CoRR abs/2007.08477 (2020) - [i11]Vineet Goyal, Garud Iyengar, Rajan Udwani:
Online Allocation of Reusable Resources via Algorithms Guided by Fluid Approximations. CoRR abs/2010.03983 (2020)
2010 – 2019
- 2019
- [j28]Yu Luo
, Garud Iyengar
, Venkat Venkatasubramanian
:
A One-Third Advice Rule Based on a Control-Theoretic Opinion Dynamics Model. IEEE Trans. Comput. Soc. Syst. 6(3): 576-581 (2019) - [c19]Hal James Cooper, Garud Iyengar, Ching-Yung Lin:
Deep Influence Diagrams: An Interpretable and Robust Decision Support System. BIS (1) 2019: 450-462 - [c18]Hal James Cooper, Garud Iyengar, Ching-Yung Lin:
Personalized Product Recommendation for Interactive Media. IHSI 2019: 510-516 - [c17]Min-hwan Oh, Garud Iyengar:
Sequential Anomaly Detection using Inverse Reinforcement Learning. KDD 2019: 1480-1490 - [c16]Min-hwan Oh, Garud Iyengar:
Thompson Sampling for Multinomial Logit Contextual Bandits. NeurIPS 2019: 3145-3155 - [c15]Omar Besbes, Antoine Désir, Vineet Goyal, Garud Iyengar, Raghav Singal:
Shapley Meets Uniform: An Axiomatic Framework for Attribution in Online Advertising. WWW 2019: 1713-1723 - 2018
- [j27]Rodrigo A. Carrasco
, Garud Iyengar, Cliff Stein:
Resource cost aware scheduling. Eur. J. Oper. Res. 269(2): 621-632 (2018) - [j26]Maximilian Haas-Heger
, Garud Iyengar
, Matei T. Ciocarlie
:
Passive Reaction Analysis for Grasp Stability. IEEE Trans Autom. Sci. Eng. 15(3): 955-966 (2018) - [j25]Yu Luo
, Garud Iyengar
, Venkat Venkatasubramanian
:
Social Influence Makes Self-Interested Crowds Smarter: An Optimal Control Perspective. IEEE Trans. Comput. Soc. Syst. 5(1): 200-209 (2018) - [c14]Hal James Cooper, Garud Iyengar, Ching-Yung Lin:
Interpretable Robust Decision Making. AAMAS 2018: 1912-1914 - [c13]Maximilian Haas-Heger, Christos H. Papadimitriou, Mihalis Yannakakis, Garud Iyengar, Matei T. Ciocarlie:
Passive Static Equilibrium with Frictional Contacts and Application to Grasp Stability Analysis. Robotics: Science and Systems 2018 - [i10]Maximilian Haas-Heger, Garud Iyengar, Matei T. Ciocarlie:
Passive Reaction Analysis for Grasp Stability. CoRR abs/1801.06558 (2018) - [i9]Francois Fagan, Garud Iyengar:
Unbiased scalable softmax optimization. CoRR abs/1803.08577 (2018) - [i8]Maximilian Haas-Heger, Christos H. Papadimitriou, Mihalis Yannakakis, Garud Iyengar, Matei T. Ciocarlie:
Passive Static Equilibrium with Frictional Contacts and Application to Grasp Stability Analysis. CoRR abs/1806.01384 (2018) - [i7]Francois Fagan, Garud Iyengar:
Robust Implicit Backpropagation. CoRR abs/1808.02433 (2018) - [i6]Hal James Cooper, Garud Iyengar, Ching-Yung Lin:
Attainment Ratings for Graph-Query Recommendation. CoRR abs/1808.05988 (2018) - [i5]Min-hwan Oh, Garud Iyengar:
Directed Exploration in PAC Model-Free Reinforcement Learning. CoRR abs/1808.10552 (2018) - 2017
- [j24]Yupeng Chen, Raghuram Iyengar, Garud Iyengar:
Modeling Multimodal Continuous Heterogeneity in Conjoint Analysis - A Sparse Learning Approach. Mark. Sci. 36(1): 140-156 (2017) - [c12]Donald Goldfarb, Garud Iyengar, Chaoxu Zhou:
Linear Convergence of Stochastic Frank Wolfe Variants. AISTATS 2017: 1066-1074 - 2016
- [j23]Martin Haugh, Garud Iyengar, Chun Wang:
Tax-Aware Dynamic Asset Allocation. Oper. Res. 64(4): 849-866 (2016) - [j22]Carlos Abad, Garud Iyengar:
A Near-Optimal Maintenance Policy for Automated DR Devices. IEEE Trans. Smart Grid 7(3): 1411-1419 (2016) - [c11]Maximilian Haas-Heger, Garud Iyengar, Matei T. Ciocarlie:
On the Distinction between Active and Passive Reaction in Grasp Stability Analysis. WAFR 2016: 448-463 - [i4]Yu Luo, Garud Iyengar, Venkat Venkatasubramanian:
Social influence makes self-interested crowds smarter: an optimal control perspective. CoRR abs/1611.01558 (2016) - 2015
- [j21]Necdet S. Aybat, Garud Iyengar:
An alternating direction method with increasing penalty for stable principal component pursuit. Comput. Optim. Appl. 61(3): 635-668 (2015) - [j20]Daniel Soudry, Suraj Keshri, Patrick Stinson, Min-hwan Oh, Garud Iyengar, Liam Paninski:
Efficient "Shotgun" Inference of Neural Connectivity from Highly Sub-sampled Activity Data. PLoS Comput. Biol. 11(10) (2015) - [j19]Carlos Abad, Garud Iyengar:
Portfolio Selection with Multiple Spectral Risk Constraints. SIAM J. Financial Math. 6(1): 467-486 (2015) - [c10]Necdet S. Aybat, Zi Wang, Garud Iyengar:
An Asynchronous Distributed Proximal Gradient Method for Composite Convex Optimization. ICML 2015: 2454-2462 - 2014
- [j18]Necdet S. Aybat, Garud Iyengar:
A unified approach for minimizing composite norms. Math. Program. 144(1-2): 181-226 (2014) - [c9]Vineet Goyal, Garud Iyengar, Quique Schwarz, Shuangyu Wang:
Optimal price rebates for demand response under power flow constraints. SmartGridComm 2014: 626-631 - 2013
- [j17]Garud Iyengar, Alfred Ka Chun Ma:
Fast gradient descent method for Mean-CVaR optimization. Ann. Oper. Res. 205(1): 203-212 (2013) - [j16]Chen Chen, Garud Iyengar, Ciamac C. Moallemi:
An Axiomatic Approach to Systemic Risk. Manag. Sci. 59(6): 1373-1388 (2013) - [j15]Rodrigo A. Carrasco
, Garud Iyengar, Cliff Stein:
Single machine scheduling with job-dependent convex cost and arbitrary precedence constraints. Oper. Res. Lett. 41(5): 436-441 (2013) - [c8]Vineet Goyal, Garud Iyengar, Zhen Qiu:
Near-optimal execution policies for demand-response contracts in electricity markets. CDC 2013: 3697-3702 - 2012
- [j14]Necdet S. Aybat, Garud Iyengar:
A First-Order Augmented Lagrangian Method for Compressed Sensing. SIAM J. Optim. 22(2): 429-459 (2012) - 2011
- [j13]Willemien Kets
, Garud Iyengar, Rajiv Sethi, Samuel Bowles:
Inequality and network structure. Games Econ. Behav. 73(1): 215-226 (2011) - [j12]Garud Iyengar, David J. Phillips, Clifford Stein:
Approximating Semidefinite Packing Programs. SIAM J. Optim. 21(1): 231-268 (2011) - [j11]Necdet S. Aybat, Garud Iyengar:
A First-Order Smoothed Penalty Method for Compressed Sensing. SIAM J. Optim. 21(1): 287-313 (2011) - [i3]Rodrigo A. Carrasco, Garud Iyengar, Clifford Stein:
Energy Aware Scheduling for Weighted Completion Time and Weighted Tardiness. CoRR abs/1110.0685 (2011) - 2010
- [c7]Garud Iyengar, David J. Phillips, Clifford Stein:
Feasible and Accurate Algorithms for Covering Semidefinite Programs. SWAT 2010: 150-162
2000 – 2009
- 2007
- [j10]Emre Erdogan, Garud Iyengar:
On two-stage convex chance constrained problems. Math. Methods Oper. Res. 65(1): 115-140 (2007) - [c6]Garud Iyengar, Anuj Kumar:
An equilibrium model for matching impatient demand and patient supply over time. EC 2007: 59-65 - [c5]Garud Iyengar, David J. Phillips, Clifford Stein:
Models of malicious behavior in sponsored search. SpringSim (3) 2007: 143-151 - 2006
- [j9]Emre Erdogan, Garud Iyengar:
Ambiguous chance constrained problems and robust optimization. Math. Program. 107(1-2): 37-61 (2006) - [j8]Daniel Bienstock, Garud Iyengar:
Approximating Fractional Packings and Coverings in O(1/epsilon) Iterations. SIAM J. Comput. 35(4): 825-854 (2006) - [j7]Emre Erdogan, Garud Iyengar:
An Active Set Method for Single-Cone Second-Order Cone Programs. SIAM J. Optim. 17(2): 459-484 (2006) - [i2]Garud Iyengar, Anuj Kumar:
Characterizing Optimal Adword Auctions. CoRR abs/cs/0611063 (2006) - [i1]Garud Iyengar, Anuj Kumar:
An equilibrium model for matching impatient demand and patient supply over time. CoRR abs/cs/0612065 (2006) - 2005
- [j6]Garud N. Iyengar:
Robust Dynamic Programming. Math. Oper. Res. 30(2): 257-280 (2005) - [j5]Mehmet Tolga Çezik, Garud Iyengar:
Cuts for mixed 0-1 conic programming. Math. Program. 104(1): 179-202 (2005) - [j4]Garud Iyengar, Wanmo Kang:
Inverse conic programming with applications. Oper. Res. Lett. 33(3): 319-330 (2005) - [c4]Garud Iyengar, David J. Phillips, Clifford Stein:
Approximation Algorithms for Semidefinite Packing Problems with Applications to Maxcut and Graph Coloring. IPCO 2005: 152-166 - 2004
- [c3]Daniel Bienstock, Garud Iyengar:
Solving fractional packing problems in Oast(1/?) iterations. STOC 2004: 146-155 - 2003
- [j3]Donald Goldfarb, Garud Iyengar:
Robust Portfolio Selection Problems. Math. Oper. Res. 28(1): 1-38 (2003) - [j2]Donald Goldfarb, Garud Iyengar:
Robust convex quadratically constrained programs. Math. Program. 97(3): 495-515 (2003) - 2001
- [c2]Garud Iyengar, Mehmet Tolga Çezik:
Cutting Planes for Mixed 0-1 Semidefinite Programs. IPCO 2001: 251-263 - 2000
- [j1]Garud Iyengar, Thomas M. Cover:
Growth optimal investment in horse race markets with costs. IEEE Trans. Inf. Theory 46(7): 2675-2683 (2000)
1990 – 1999
- 1998
- [c1]Debajyoti Pal, Garud N. Iyengar, John M. Cioffi:
A new method of channel shortening with applications to discrete multi-tone (DMT) systems. ICC 1998: 763-768
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint