Garvit Juniwal

Garvit Juniwal

Bengaluru, Karnataka, India
4K followers 500+ connections

About

Building a category-defining product with a world-class team at Glean…

Activity

Join now to see all activity

Experience

  • Glean Graphic

    Glean

    Bengaluru, Karnataka, India

  • -

  • -

    San Francisco Bay Area

  • -

    San Francisco Bay Area

  • -

    San Francisco Bay Area

  • -

  • -

  • -

  • -

  • -

Education

  • Indian Institute of Technology, Bombay Graphic

    Indian Institute of Technology, Bombay

    -

    GPA 9.7, Department Rank 2 (Institute Gold Medal), JEE AIR-10
    Minor in Statistics and Informatics

  • -

    6 publications, 900+ citations, 2 best paper awards

  • - Present

    Reinforcement Learning, Deep Learning

Publications

  • Finding Instability in Biological Models

    CAV 2014

    The stability of biological models is an important test for establishing
    their soundness and accuracy. Stability in biological systems
    represents the ability of a robust system to always return to homeostasis.
    In recent work, modular approaches for proving stability have been
    found to be swift and scalable. If stability is however not proved, the
    currently available techniques apply an exhaustive search through the
    unstable state space to find loops. This search is frequently…

    The stability of biological models is an important test for establishing
    their soundness and accuracy. Stability in biological systems
    represents the ability of a robust system to always return to homeostasis.
    In recent work, modular approaches for proving stability have been
    found to be swift and scalable. If stability is however not proved, the
    currently available techniques apply an exhaustive search through the
    unstable state space to find loops. This search is frequently prohibitively
    computationally expensive, limiting its usefulness. Here we present a
    new modular approach eliminating the need for an exhaustive search
    for loops. Using models of biological systems we show that the technique
    finds loops significantly faster than brute force approaches. Furthermore,
    for a subset of stable systems which are resistant to modular proofs, we
    observe a speed up of up to 3 orders of magnitude as the exhaustive
    searches for loops which cause instability are avoided. With our new
    procedure we are able to prove instability and stability in a number of
    realistic biological models, including adaptation in bacterial chemotaxis,
    the lambda phage lysogeny/lysis switch, voltage gated channel opening
    and cAMP oscillations in the slime mold Dictyostelium discoideum. This
    new approach will support the development of new clinically relevant
    tools for industrial biomedicine.

    Other authors
    • Byron Cook
    • Jasmin Fisher
    • Benjamin A. Hall
    • Samin Ishtiaq
    • Nir Piterman
    See publication
  • Syntax-Guided Synthesis

    FMCAD 2013

    The classical formulation of the program-synthesis problem is to find a program that meets a correctness specification given as a logical formula. Recent work on program synthesis and program optimization illustrates many potential benefits of allowing the user to supplement the logical specification with a syntactic template that constrains the space of allowed implementations. Our goal is to identify the core computational problem common to these proposals in a logical framework. The input to…

    The classical formulation of the program-synthesis problem is to find a program that meets a correctness specification given as a logical formula. Recent work on program synthesis and program optimization illustrates many potential benefits of allowing the user to supplement the logical specification with a syntactic template that constrains the space of allowed implementations. Our goal is to identify the core computational problem common to these proposals in a logical framework. The input to the syntax-guided synthesis problem (SyGuS) consists of a background theory, a semantic correctness specification for the desired program given by a logical formula, and a syntactic set of candidate implementations given by a grammar. The computational problem then is to find an implementation from the set of candidate expressions so that it satisfies the specification in the given theory. We describe three different instantiations of the counter-example-guided-inductive-synthesis (CEGIS) strategy for solving the synthesis problem, report on prototype implementations, and present experimental results on an initial set of benchmarks.

    Other authors
    See publication
  • CPSGrader: Synthesizing Temporal Logic Testers for Auto-Grading an Embedded Systems Laboratory

    EMSOFT 2014

    We consider the problem of designing an automatic grader for a
    laboratory in the area of cyber-physical systems. The goal of this
    laboratory is to program a robot for specified navigation tasks. Given
    a candidate student solution (control program for the robot), our
    grader first checks whether the robot performs the task correctly
    under a representative set of environment conditions. If it does
    not, the grader automatically generates feedback hinting at possible
    errors in…

    We consider the problem of designing an automatic grader for a
    laboratory in the area of cyber-physical systems. The goal of this
    laboratory is to program a robot for specified navigation tasks. Given
    a candidate student solution (control program for the robot), our
    grader first checks whether the robot performs the task correctly
    under a representative set of environment conditions. If it does
    not, the grader automatically generates feedback hinting at possible
    errors in the program. The auto-grader is based on a notion
    of constrained parameterized tests based on Signal Temporal Logic
    (STL) that capture symptoms pointing to success or causes of failure
    in traces obtained from a realistic simulator. We define and
    solve the problem of synthesizing constraints on a parameterized
    test such that it is consistent with a set of reference solutions with
    and without the desired symptom. The usefulness of our grader
    is demonstrated using a large data set obtained from an actual oncampus
    laboratory course.

    Other authors
    • Alexandre Donze
    • Jeff C. Jensen
    • Sanjit A. Seshia
    See publication
  • ddNF: An Efficient Data Structure for Header Spaces

    Haifa Verification Conference (HVC) 2016

    Best paper award

    Other authors
    • Nikolaj Bjorner
    • Sanjit Seshia
    • George Varghese
    • Ratul Mahajan
  • Robust Online Monitoring of Signal Temporal Logic

    Runtime Verification Conference (RV) 2015

    Best paper award

    Other authors

Courses

  • Applied Stochastic Processes

    SI 404

  • Artificial Intelligence

    CS 344

  • Basic Algebra

    MA 419

  • Combinatorial Algorithms and Data Structures

    CS 270

  • Computer Networks

    CS 348

  • Computer-Aided Verification

    CS 219C

  • Data Structures and Algorithms

    CS 213

  • Database and Information Systems

    CS 387

  • Deep Learning

    CS230

  • Design and Analysis of Algorithms

    CS 218

  • Design and Analysis of Programming Languages

    CS 263

  • Distributed Computing

    CS 294

  • Fundamental Algorithms for System Design and Analysis

    CS 244

  • Graph Theory

    CS 408

  • Information Theory and Coding

    EE 708

  • Introduction to Derivatives Pricing

    SI 527

  • Operating Systems

    CS 347

  • Program Synthesis

    CS 294

  • Regression Analysis

    SI 422

  • Reinforcement Learning

    CS234

  • Statistical Inference

    SI 402

  • Statistical Learning Theory

    CS 281A

  • Time Series Analysis

    SI 509

Projects

  • SyGuS

    Developed the symbolic solver for Syntax-Guided Synthesis competition. The solver inductively synthesizes a program directly from a high-level specification working through counter-examples. It uses the SMT solver Z3 both for synthesis (learning program from input-output examples) and verification (finding counter-examples) phases. The solver is primarily written in Python using Z3's Python API. This was publicly released as one of the three baseline solvers.

    github:…

    Developed the symbolic solver for Syntax-Guided Synthesis competition. The solver inductively synthesizes a program directly from a high-level specification working through counter-examples. It uses the SMT solver Z3 both for synthesis (learning program from input-output examples) and verification (finding counter-examples) phases. The solver is primarily written in Python using Z3's Python API. This was publicly released as one of the three baseline solvers.

    github: https://github.com/rishabhs/sygus-comp14/tree/master/solvers/symbolic
    paper: http://www.eecs.berkeley.edu/~garvitjuniwal/alur_fmcad13.html

    See project
  • CyberSim and CPSGrader

    -

    Developed an automatic grading cum feedback generation component (auto-grader or CPSGrader) for the simulation driven virtual robotics laboratory (CyberSim) used in the online Cyber-Physical Systems course EECS 149.1x offered on edX. This is the first online course to use a virtual laboratory and the first deployed auto-grader that uses formal verification. CPSGrader uses Signal Temporal Logic based test benches to monitor simulation traces of student solutions. Each test bench serves as a…

    Developed an automatic grading cum feedback generation component (auto-grader or CPSGrader) for the simulation driven virtual robotics laboratory (CyberSim) used in the online Cyber-Physical Systems course EECS 149.1x offered on edX. This is the first online course to use a virtual laboratory and the first deployed auto-grader that uses formal verification. CPSGrader uses Signal Temporal Logic based test benches to monitor simulation traces of student solutions. Each test bench serves as a classifier to detect presence of a particular kind of fault and we automatically learn/synthesize the classification boundaries using a library of previously known correct and faulty solutions. The robotics simulator is written in LabVIEW, the auto-grader is an independent library written in C that plugs into the simulator, and the test bench synthesis is done in MATLAB using the Breach toolbox. A survey conducted at the end of the course shows that 86% of students find the feedback from the auto-grader crucial in completing the lab exercises.

    Also see: https://www.edx.org/course/uc-berkeleyx/uc-berkeleyx-eecs149-1x-cyber-physical-1629#.U6-iAY1dUqc

    Other creators
    • Alexandre Donze
    • Jeff C. Jensen
    • Sanjit A. Seshia
    See project
  • Clustering-Based Active Learning for CPSGrader

    -

    CPSGrader (the auto-grader used in the online Cyber-Physical Systems course EECS 149.1x)
    learns a fault classifier using a few examples of correct and faulty student solutions as training
    data. Unlabeled data is abundant but manually labeling as faulty/non-faulty is tedious. We
    developed an active learning algorithm to choose the new data points to obtain labels for.
    The data points in our case are multi-dimensional time series obtained from the physics-based
    robotics…

    CPSGrader (the auto-grader used in the online Cyber-Physical Systems course EECS 149.1x)
    learns a fault classifier using a few examples of correct and faulty student solutions as training
    data. Unlabeled data is abundant but manually labeling as faulty/non-faulty is tedious. We
    developed an active learning algorithm to choose the new data points to obtain labels for.
    The data points in our case are multi-dimensional time series obtained from the physics-based
    robotics simulator CyberSim. We cluster the data using density based scanning (DBSCAN )
    with dynamic time warping (DTW) distance as the similarity metric. Active learning enables
    us to achieve same accuracy levels for the classifier using fewer training examples. DTW
    computation is implemented in R and the clustering algorithm in Python.

    Other creators
    • Sakshi Jain
    • Michael Jordan
    See project
  • Bio Model Analyzer

    -

    Bio Model Analyzer is an online tool that allows biologists to create and analyze stability properties of protein signaling networks. As a contributor to the tool, developed a stability-proving/instability- finding back-end that scales to models with few hundred proteins. The algorithm tries to find cyclic instability using interval abstraction of the transition system in a divide/conquer fashion. Implemented primarily in F#.

    Also see:…

    Bio Model Analyzer is an online tool that allows biologists to create and analyze stability properties of protein signaling networks. As a contributor to the tool, developed a stability-proving/instability- finding back-end that scales to models with few hundred proteins. The algorithm tries to find cyclic instability using interval abstraction of the transition system in a divide/conquer fashion. Implemented primarily in F#.

    Also see: http://www.eecs.berkeley.edu/~garvitjuniwal/cook-cav14.html

    Other creators
    • Benjamin Hall
    • Byron Cook
    • Jasmin Fisher
    • Samin Ishtiaq
    • Nir Piterman
    See project

Honors & Awards

  • Outstanding Graduate Student Instructor Award

    UC Berkeley

    Awarded to 9% of all Graduate Student Instructors across campus. I was a GSI for EECS 149/249 at UC Berkeley

  • Tong Leong Lim Pre-doctoral Prize

    Dept. of EECS, UC Berkeley

    Awarded for scoring a perfect 10.0/10.0 in the Computer Aided Design preliminary examination.
    This award is presented in memory of Tong Leong Lim, who ranked as the top student in his pre-doctoral examination. See http://www.eecs.berkeley.edu/Students/Awards/#lim

  • All India Rank 10 IIT JEE 2008

    IIT JEE

  • Gold Medal, International Physics Olympiad

    -

    Ranked 23rd in the world in the most prestigious Physics competition at secondary school level.

  • Scholar of National Talent Search Scheme (NTSS)

    National Council of Educational Research and Training, Govt. of India

    Awarded to about 750 high school students for general aptitude and talent.

  • Fellow of Kishore Vaigyanik Protsahan Yojana (KVPY)

    Dept. of Science and Technology, Govt. of India

    The objectives of the program are to identify students with talent and aptitude for research; help them realize their potential in their studies; encourage them to take up research careers in Science, and ensure the growth of the best scientific minds for research and development in the country. Awarded to about 95 students across the country.

More activity by Garvit

View Garvit’s full profile

  • See who you know in common
  • Get introduced
  • Contact Garvit directly
Join to view full profile

Other similar profiles

Explore collaborative articles

We’re unlocking community knowledge in a new way. Experts add insights directly into each article, started with the help of AI.

Explore More

Add new skills with these courses