◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

S. Sankaranarayanan

13 papers hereh-index 448.7k citations251 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • middle author4
  • last author9

Across the 13 of 13 papers where every author was matched, so the position is known.

fields
  • math.OC4
  • cs.LG3
  • cs.RO3
  • cs.CR1
  • cs.PL1
  • math.DS1
same name
  • S. Sankaranarayanan — 13 papers, h 51
  • S. Sankaranarayanan — 3 papers, h 19

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20172024
most citedOutput Range Analysis for Deep Neural Networks

75 citations · 86 across the 8 of their papers we have counts for

collaborators
Showing math.OCShow all

4 papers · 1 filter

math.OC2020

Training Neural Network Controllers Using Control Barrier Functions in the Presence of Disturbances

Shakiba Yaghoubi, Georgios Fainekos, Sriram Sankaranarayanan

Control Barrier Functions (CBF) have been recently utilized in the design of provably safe feedback control laws for nonlinear systems. These feedback control methods typically com…

math.OC2019★ 1 cited

A learning-based algorithm to quickly compute good primal solutions for Stochastic Integer Programs

Yoshua Bengio, Emma Frejinger, Andrea Lodi +2

We propose a novel approach using supervised learning to obtain near-optimal primal solutions for two-stage stochastic integer programming (2SIP) problems with constraints in the f…

math.OC2018

Mixed-integer bilevel representability

Amitabh Basu, Christopher Thomas Ryan, Sriram Sankaranarayanan

We study the representability of sets that admit extended formulations using mixed-integer bilevel programs. We show that feasible regions modeled by continuous bilevel constraints…

math.OC2018

Can cut generating functions be good and efficient?

Amitabh Basu, Sriram Sankaranarayanan

Making cut generating functions (CGFs) computationally viable is a central question in modern integer programming research. One would like to find CGFs that are simultaneously good…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.