Aniruddha Joshi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Aniruddha Joshi has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- S. Akshay
Indian Institute of Technology Bombay
3 shared publications - Supratik Chakraborty
Indian Institute of Technology Bombay
3 shared publications - Hazem Torfah
Chalmers University of Technology University of Gothenburg Sweden
2 shared publications - Sanjit A. Seshia
University of California, Berkeley, Berkeley, California, USA
2 shared publications - Shetal Shah
Indian Institute of Technology Bombay
2 shared publications - Govind Rajanbabu
The Institute of Mathematical Sciences
1 shared publication
Latest Publications
- Open Access
- 24 July 2026
- Published by Springer Nature
- p. 248-266
Program Synthesis for Non-linear Real Arithmetic: Going Beyond Realizability
We study the problem of synthesizing programs from non-linear real arithmetic () specifications. Existing techniques, such as syntax-guided synthesis (), fail to synthesize programs when the specification is unrealizable . We argue this is unsatisfactory in many situations, and aim to synthesize programs from arbitrary specifications, such that for any input, the synthesized program either produces outputs satisfying the specification or reports non-existence of any such output. To avoid rounding errors inherent in floating-point arithmetic, we restrict our programs to work on rational inputs and outputs. We first show that our variant of the synthesis problem is as hard as a long-standing open problem in number theory, and that synthesizing loop-free programs from arbitrary NRA specifications with rational inputs and outputs is impossible in general. Second, we present a sound and complete synthesis algorithm for the case where the specification involves a single output variable. We also show that for realizable specifications, a program generated by for (real inputs and outputs) serves as a solution to our problem, where inputs and outputs are rationals. Third, we provide a sound (but necessarily incomplete) synthesis algorithm for the general case of specifications. We have implemented our approach in a prototype tool called that solves many benchmarks beyond the reach of state-of-the-art SyGuS tools, even when we render the specifications realizable.
- 24 July 2026
- Published by Springer Nature
- p. 248-266
Open AccessProgram Synthesis for Non-linear Real Arithmetic: Going Beyond Realizability
We study the problem of synthesizing programs from non-linear real arithmetic () specifications. Existing techniques, such as syntax-guided synthesis (), fail to synthesize programs when the specification is unrealizable . We argue this is unsatisfactory in many situations, and aim to synthesize programs from arbitrary specifications, such that for any input, the synthesized program either produces outputs satisfying the specification or reports non-existence of any such output. To avoid rounding errors inherent in floating-point arithmetic, we restrict our programs to work on rational inputs and outputs. We first show that our variant of the synthesis problem is as hard as a long-standing open problem in number theory, and that synthesizing loop-free programs from arbitrary NRA specifications with rational inputs and outputs is impossible in general. Second, we present a sound and complete synthesis algorithm for the case where the specification involves a single output variable. We also show that for realizable specifications, a program generated by for (real inputs and outputs) serves as a solution to our problem, where inputs and outputs are rationals. Third, we provide a sound (but necessarily incomplete) synthesis algorithm for the general case of specifications. We have implemented our approach in a prototype tool called that solves many benchmarks beyond the reach of state-of-the-art SyGuS tools, even when we render the specifications realizable.
- 26 October 2025
- Published by Springer Nature
- p. 321-341
Locally Pareto-Optimal Interpretations for Black-Box Machine Learning Models
- 26 October 2025
- Published by Springer Nature
- p. 321-341
Locally Pareto-Optimal Interpretations for Black-Box Machine Learning Models
- Open Access
Locally Pareto-Optimal Interpretations for Black-Box Machine Learning Models
Creating meaningful interpretations for black-box machine learning models involves balancing two often conflicting objectives: accuracy and explainability. Exploring the trade-off between these objectives is essential for developing trustworthy interpretations. While many techniques for multi-objective interpretation synthesis have been developed, they typically lack formal guarantees on the Pareto-optimality of the results. Methods that do provide such guarantees, on the other hand, often face severe scalability limitations when exploring the Pareto-optimal space. To address this, we develop a framework based on local optimality guarantees that enables more scalable synthesis of interpretations. Specifically, we consider the problem of synthesizing a set of Pareto-optimal interpretations with local optimality guarantees, within the immediate neighborhood of each solution. Our approach begins with a multi-objective learning or search technique, such as Multi-Objective Monte Carlo Tree Search, to generate a best-effort set of Pareto-optimal candidates with respect to accuracy and explainability. We then verify local optimality for each candidate as a Boolean satisfiability problem, which we solve using a SAT solver. We demonstrate the efficacy of our approach on a set of benchmarks, comparing it against previous methods for exploring the Pareto-optimal front of interpretations. In particular, we show that our approach yields interpretations that closely match those synthesized by methods offering global guarantees.
Open AccessLocally Pareto-Optimal Interpretations for Black-Box Machine Learning Models
Creating meaningful interpretations for black-box machine learning models involves balancing two often conflicting objectives: accuracy and explainability. Exploring the trade-off between these objectives is essential for developing trustworthy interpretations. While many techniques for multi-objective interpretation synthesis have been developed, they typically lack formal guarantees on the Pareto-optimality of the results. Methods that do provide such guarantees, on the other hand, often face severe scalability limitations when exploring the Pareto-optimal space. To address this, we develop a framework based on local optimality guarantees that enables more scalable synthesis of interpretations. Specifically, we consider the problem of synthesizing a set of Pareto-optimal interpretations with local optimality guarantees, within the immediate neighborhood of each solution. Our approach begins with a multi-objective learning or search technique, such as Multi-Objective Monte Carlo Tree Search, to generate a best-effort set of Pareto-optimal candidates with respect to accuracy and explainability. We then verify local optimality for each candidate as a Boolean satisfiability problem, which we solve using a SAT solver. We demonstrate the efficacy of our approach on a set of benchmarks, comparing it against previous methods for exploring the Pareto-optimal front of interpretations. In particular, we show that our approach yields interpretations that closely match those synthesized by methods offering global guarantees.