Amitabh Basu

Publication Activity (10 Years)

Years Active: 2004-2024
Publications (10 Years): 64

Top Topics

Convex Minimization

Integer Variables

Top Venues

Publications

Sammy Khalife, Hongyu Cheng, Amitabh Basu
Neural networks with linear threshold activations: structure and algorithms. Math. Program. 206 (1) (2024)
Hongyu Cheng, Amitabh Basu
Learning Cut Generating Functions for Integer Programming. CoRR (2024)
Hongyu Cheng, Sammy Khalife, Barbara Fiedorowicz, Amitabh Basu
Data-driven algorithm design using neural networks with applications to branch-and-cut. CoRR (2024)
Hayden S. Helm, Amitabh Basu, Avanti Athreya, Youngser Park, Joshua T. Vogelstein, Carey E. Priebe, Michael Winding, Marta Zlatic, Albert Cardona, Patrick Bourke, Jonathan Larson, Marah Ihab Abdin, Piali Choudhury, Weiwei Yang, Christopher W. White
Distance-based positive and unlabeled learning for ranking. Pattern Recognit. 134 (2023)
Amitabh Basu, Hongyi Jiang
Two-halfspace closure. Math. Program. 197 (1) (2023)
Sammy Khalife, Amitabh Basu
On the power of graph neural networks and the role of the activation function. CoRR (2023)
Amitabh Basu, Hongyi Jiang, Phillip A. Kerger, Marco Molinaro
Information Complexity of Mixed-Integer Convex Optimization. IPCO (2023)
Amitabh Basu
Complexity of optimizing over the integers. Math. Program. 200 (2) (2023)
Amitabh Basu, Michele Conforti, Marco Di Summa, Hongyi Jiang
Complexity of branch-and-bound and cutting planes in mixed-integer optimization. Math. Program. 198 (1) (2023)
Christoph Hertrich, Amitabh Basu, Marco Di Summa, Martin Skutella
Towards Lower Bounds on the Depth of ReLU Neural Networks. SIAM J. Discret. Math. 37 (2) (2023)
Hongyi Jiang, Amitabh Basu
Enumerating Integer Points in Polytopes with Bounded Subdeterminants. SIAM J. Discret. Math. 36 (1) (2022)
Amitabh Basu, Michele Conforti, Marco Di Summa, Hongyi Jiang
Complexity of Branch-and-Bound and Cutting Planes in Mixed-Integer Optimization - II. Comb. 42 (6) (2022)
Sammy Khalife, Amitabh Basu
Neural Networks with Linear Threshold Activations: Structure and Algorithms. IPCO (2022)
Amitabh Basu, Michele Conforti, Marco Di Summa, Hongyi Jiang
Complexity of Branch-and-Bound and Cutting Planes in Mixed-Integer Optimization - II. IPCO (2021)
Christoph Hertrich, Amitabh Basu, Marco Di Summa, Martin Skutella
Towards Lower Bounds on the Depth of ReLU Neural Networks. CoRR (2021)
Amitabh Basu, Michele Conforti, Marco Di Summa, Hongyi Jiang
Split Cuts in the Plane. SIAM J. Optim. 31 (1) (2021)
Christoph Hertrich, Amitabh Basu, Marco Di Summa, Martin Skutella
Towards Lower Bounds on the Depth of ReLU Neural Networks. NeurIPS (2021)
Amitabh Basu
Complexity of optimizing over the integers. CoRR (2021)
Amitabh Basu, Tongtong Chen, Michele Conforti, Hongyi Jiang
Helly systems and certificates in optimization. CoRR (2021)
Amitabh Basu, Christopher Thomas Ryan, Sriram Sankaranarayanan
Mixed-integer bilevel representability. Math. Program. 185 (1-2) (2021)
Amitabh Basu, Tu Nguyen, Ao Sun
Admissibility of Solution Estimators for Stochastic Optimization. SIAM J. Math. Data Sci. 3 (1) (2021)
Hayden S. Helm, Marah Abdin, Benjamin D. Pedigo, Shweti Mahajan, Vince Lyzinski, Youngser Park, Amitabh Basu, Piali Choudhury, Christopher M. White, Weiwei Yang, Carey E. Priebe
Leveraging semantically similar queries for ranking via combining representations. CoRR (2021)
Sammy Khalife, Amitabh Basu
Neural networks with linear threshold activations: structure and algorithms. CoRR (2021)
Amitabh Basu, Michele Conforti, Marco Di Summa
An extreme function which is nonnegative and discontinuous everywhere. Math. Program. 179 (1) (2020)
Amitabh Basu, Michele Conforti, Marco Di Summa, Hongyi Jiang
Complexity of branch-and-bound and cutting planes in mixed-integer optimization - II. CoRR (2020)
Amitabh Basu, Michele Conforti, Marco Di Summa, Hongyi Jiang
Complexity of cutting planes and branch-and-bound in mixed-integer optimization. CoRR (2020)
Hayden S. Helm, Amitabh Basu, Avanti Athreya, Youngser Park, Joshua T. Vogelstein, Michael Winding, Marta Zlatic, Albert Cardona, Patrick Bourke, Jonathan Larson, Christopher M. White, Carey E. Priebe
Learning to rank via combining representations. CoRR (2020)
Amitabh Basu, Michele Conforti, Marco Di Summa, Joseph Paat
The Structure of the Infinite Models in Integer Programming. Math. Oper. Res. 44 (4) (2019)
Amitabh Basu, R. Kipp Martin, Christopher Thomas Ryan, Guanyi Wang
Mixed-Integer Linear Representability, Disjunctions, and Chvátal Functions - Modeling Implications. Math. Oper. Res. 44 (4) (2019)
Amitabh Basu, Santanu S. Dey, Joseph Paat
Nonunique Lifting of Integer Variables in Minimal Inequalities. SIAM J. Discret. Math. 33 (2) (2019)
Amitabh Basu, Sriram Sankaranarayanan
Can Cut-Generating Functions Be Good and Efficient? SIAM J. Optim. 29 (2) (2019)
Amitabh Basu, Michele Conforti, Marco Di Summa, Giacomo Zambelli
Optimal Cutting Planes from the Group Relaxations. Math. Oper. Res. 44 (4) (2019)
Akshay Rangamani, Anirbit Mukherjee, Amitabh Basu, Ashish Arora, Tejaswini Ganapathi, Sang Peter Chin, Trac D. Tran
Sparse Coding and Autoencoders. ISIT (2018)
Gennadiy Averkov, Amitabh Basu, Joseph Paat
Approximation of Corner Polyhedra with Families of Intersection Cuts. SIAM J. Optim. 28 (1) (2018)
Amitabh Basu, Michele Conforti, Marco Di Summa, Joseph Paat
Extreme functions with an arbitrary number of slopes. Math. Program. 172 (1-2) (2018)
Raman Arora, Amitabh Basu, Poorya Mianjy, Anirbit Mukherjee
Understanding Deep Neural Networks with Rectified Linear Units. ICLR (Poster) (2018)
Teresa M. Lebair, Amitabh Basu
Approximation of Minimal Functions by Extreme Functions. SIAM J. Optim. 28 (3) (2018)
Amitabh Basu, Robert Hildebrand, Marco Molinaro
Minimal cut-generating functions are nearly extreme. Math. Program. 172 (1-2) (2018)
Amitabh Basu, Soham De, Anirbit Mukherjee, Enayat Ullah
Convergence guarantees for RMSProp and ADAM in non-convex optimization and their comparison to Nesterov acceleration on autoencoders. CoRR (2018)
Anirbit Mukherjee, Amitabh Basu
Lower bounds over Boolean inputs for deep neural networks with ReLU gates. CoRR (2017)
Amitabh Basu, Michele Conforti, Marco Di Summa, Joseph Paat
The Structure of the Infinite Models in Integer Programming. IPCO (2017)
Akshay Rangamani, Anirbit Mukherjee, Ashish Arora, Tejaswini Ganapathy, Amitabh Basu, Sang Peter Chin, Trac D. Tran
Critical Points Of An Autoencoder Can Provably Recover Sparsely Used Overcomplete Dictionaries. CoRR (2017)
Amitabh Basu, R. Kipp Martin, Christopher Thomas Ryan, Guanyi Wang
Mixed-Integer Linear Representability, Disjunctions, and Variable Elimination. IPCO (2017)
Amitabh Basu, Richard Kipp Martin, Christopher Thomas Ryan
Strong duality and sensitivity analysis in semi-infinite linear programming. Math. Program. 161 (1-2) (2017)
Anirbit Mukherjee, Amitabh Basu
Lower bounds over Boolean inputs for deep neural networks with ReLU gates. Electron. Colloquium Comput. Complex. 24 (2017)
Amitabh Basu, Timm Oertel
Centerpoints: A Link between Optimization and Convex Geometry. SIAM J. Optim. 27 (2) (2017)
Amitabh Basu, Robert Hildebrand, Matthias Köppe
Equivariant perturbation in Gomory and Johnson's infinite group problem - III: foundations for the k-dimensional case with applications to k=2. Math. Program. 163 (1-2) (2017)
Gennadiy Averkov, Amitabh Basu, Joseph Paat
Approximation of Corner Polyhedra with Families of Intersection Cuts. IPCO (2017)
Raman Arora, Amitabh Basu, Poorya Mianjy, Anirbit Mukherjee
Understanding Deep Neural Networks with Rectified Linear Units. Electron. Colloquium Comput. Complex. 24 (2017)
Amitabh Basu, Michele Conforti, Gérard Cornuéjols, Robert Weismantel, Stefan Weltge
Optimality certificates for convex minimization and Helly numbers. Oper. Res. Lett. 45 (6) (2017)
Amitabh Basu, Robert Hildebrand, Matthias Köppe
Light on the infinite group relaxation I: foundations and taxonomy. 4OR 14 (1) (2016)
Amitabh Basu, Michael Dinitz, Xin Li
Computing approximate PSD factorizations. CoRR (2016)
Amitabh Basu, Robert Hildebrand, Marco Molinaro
Minimal Cut-Generating Functions are Nearly Extreme. IPCO (2016)
Amitabh Basu, Michele Conforti, Marco Di Summa, Joseph Paat
Extreme Functions with an Arbitrary Number of Slopes. IPCO (2016)
Amitabh Basu, Robert Hildebrand, Matthias Köppe
Light on the infinite group relaxation II: sufficient conditions for extremality, sequences, and algorithms. 4OR 14 (2) (2016)
Raman Arora, Amitabh Basu, Poorya Mianjy, Anirbit Mukherjee
Understanding Deep Neural Networks with Rectified Linear Units. CoRR (2016)
Amitabh Basu, Michael Dinitz, Xin Li
Computing Approximate PSD Factorizations. APPROX-RANDOM (2016)
Amitabh Basu, Timm Oertel
Centerpoints: A Link Between Optimization and Convex Geometry. IPCO (2016)
Amitabh Basu, Michele Conforti, Marco Di Summa
A geometric approach to cut-generating functions. Math. Program. 151 (1) (2015)
Gennadiy Averkov, Amitabh Basu
Lifting properties of maximal lattice-free polyhedra. Math. Program. 154 (1-2) (2015)
Amitabh Basu, R. Kipp Martin, Christopher Thomas Ryan
Projection: A Unified Approach to Semi-Infinite Linear Programs and Duality in Convex Programming. Math. Oper. Res. 40 (1) (2015)
Amitabh Basu, Joseph Paat
Operations that Preserve the Covering Property of the Lifting Region. SIAM J. Optim. 25 (4) (2015)
Amitabh Basu, Marco Molinaro
Characterization of the split closure via geometric lifting. Eur. J. Oper. Res. 243 (3) (2015)
Amitabh Basu, Robert Hildebrand, Matthias Köppe
Equivariant Perturbation in Gomory and Johnson's Infinite Group Problem. I. The One-Dimensional Case. Math. Oper. Res. 40 (1) (2015)
Amitabh Basu, Robert Hildebrand, Matthias Köppe
Equivariant Perturbation in Gomory and Johnson's Infinite Group Problem. III. Foundations for the k-Dimensional Case with Applications to k=2. CoRR (2014)
Amitabh Basu, Robert Hildebrand, Matthias Köppe
Light on the Infinite Group Relaxation. CoRR (2014)
Amitabh Basu, Robert Hildebrand, Matthias Köppe
The triangle closure is a polyhedron. Math. Program. 145 (1-2) (2014)
Gennadiy Averkov, Amitabh Basu
On the Unique-Lifting Property. IPCO (2014)
Amitabh Basu, R. Kipp Martin, Christopher Thomas Ryan
On the sufficiency of finite support duals in semi-infinite linear programming. Oper. Res. Lett. 42 (1) (2014)
Amitabh Basu, Jesús A. De Loera, Mark Junod
On Chubanov's Method for Linear Programming. INFORMS J. Comput. 26 (2) (2014)
Amitabh Basu, Manoel B. Campêlo, Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli
Unique lifting of integer variables in minimal inequalities. Math. Program. 141 (1-2) (2013)
Amitabh Basu, Robert Hildebrand, Matthias Köppe, Marco Molinaro
A (k+1)-Slope Theorem for the k-Dimensional Infinite Group Relaxation. SIAM J. Optim. 23 (2) (2013)
Amitabh Basu, Robert Hildebrand, Matthias Köppe
Equivariant Perturbation in Gomory and Johnson's Infinite Group Problem: II. The Unimodular Two-Dimensional Case. IPCO (2013)
Amitabh Basu, Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli
A counterexample to a conjecture of Gomory and Johnson. Math. Program. 133 (1-2) (2012)
Amitabh Basu, Robert Hildebrand, Matthias Köppe
Equivariant Perturbation in Gomory and Johnson's Infinite Group Problem. II. The Unimodular Two-Dimensional Case CoRR (2012)
Amitabh Basu, Jesús A. De Loera, Mark Junod
On Chubanov's method for Linear Programming CoRR (2012)
Amitabh Basu, Gérard Cornuéjols, Matthias Köppe
Unique Minimal Liftings for Simplicial Polytopes. Math. Oper. Res. 37 (2) (2012)
Amitabh Basu, Gérard Cornuéjols, François Margot
Intersection Cuts with Infinite Split Rank. Math. Oper. Res. 37 (1) (2012)
Amitabh Basu, Pierre Bonami, Gérard Cornuéjols, François Margot
On the relative strength of split, triangle and quadrilateral cuts. Math. Program. 126 (2) (2011)
Amitabh Basu, Robert Hildebrand, Matthias Köppe
The Triangle Closure is a Polyhedron CoRR (2011)
Amitabh Basu, Pierre Bonami, Gérard Cornuéjols, François Margot
Experiments with Two-Row Cuts from Degenerate Tableaux. INFORMS J. Comput. 23 (4) (2011)
Amitabh Basu, Gérard Cornuéjols, Marco Molinaro
A Probabilistic Analysis of the Strength of the Split and Triangle Closures. IPCO (2011)
Amitabh Basu, Robert Hildebrand, Matthias Köppe
Algorithmic and Complexity Results for Cutting Planes Derived from Maximal Lattice-Free Convex Sets CoRR (2011)
Amitabh Basu, Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli
Maximal Lattice-Free Convex Sets in Linear Subspaces. Math. Oper. Res. 35 (3) (2010)
Amitabh Basu, Manoel B. Campêlo, Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli
On Lifting Integer Variables in Minimal Inequalities. IPCO (2010)
Amitabh Basu, Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli
Minimal Inequalities for an Infinite Relaxation of Integer Programs. SIAM J. Discret. Math. 24 (1) (2010)
Amitabh Basu, Joseph S. B. Mitchell, Girishkumar Sabhnani
Geometric algorithms for optimal airspace design and air traffic controller workload balancing. ACM J. Exp. Algorithmics 14 (2009)
Amitabh Basu, Pierre Bonami, Gérard Cornuéjols, François Margot
On the relative strength of split, triangle and quadrilateral cuts. SODA (2009)
Amitabh Basu, Joseph S. B. Mitchell, Girishkumar Sabhnani
Geometric Algorithms for Optimal Airspace Design and Air Traffic Controller Workload Balancing. ALENEX (2008)
Gilles Barthe, Tamara Rezk, Amitabh Basu
Security types preserving compilation. Comput. Lang. Syst. Struct. 33 (2) (2007)
Amitabh Basu, Jie Gao, Joseph S. B. Mitchell, Girishkumar Sabhnani
Distributed localization using noisy distance and angle information. MobiHoc (2006)
Gilles Barthe, Amitabh Basu, Tamara Rezk
Security Types Preserving Compilation: (Extended Abstract). VMCAI (2004)