Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Sooraj Bhat

dblp:76/2474 · DBLP profile ↗
← Back
9ranked-venue papers
4as first author
0since 2021 · last 2017
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 4 · 2 first-authorArtificial intelligence and machine learning · 2 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-authorComputer networks · 1Human-computer interaction and ubiquitous computing · 1Theory of computation · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Software engineering, system software, and programming languages
4 papers
Programming languages and type systems · 91% Program synthesis and code generation · 5% Empirical software engineering · 5%
Artificial intelligence
3 papers
Reinforcement learning · 58% Language models and text generation · 31% Multi-agent systems · 11%
Human-computer interaction and pervasive computing
1 paper
Ubiquitous computing and smart environments · 50% Human-robot interaction · 50%
Computer networks
1 paper
Internet architecture and protocols · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%

Topics — the 12 heaviest of 15, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Programming languages and type systems
probabilistic programming
0.112012
A type theory for probability density functions · POPL 2012
Programming languages and type systems
type systems
0.112012
A type theory for probability density functions · POPL 2012
Machine learning › Reinforcement learning
markov decision process
0.112007
Authorial Idioms for Target Distributions in TTD-MDPs · AAAI 2007
Natural language and speech › Language models and text generation
text generation
0.112007
Authorial Idioms for Target Distributions in TTD-MDPs · AAAI 2007
Machine learning › Reinforcement learning › hierarchical reinforcement learning
modular reinforcement learning
0.112006
On the Difficulty of Modular Reinforcement Learning for Real-World Partial Programming · AAAI 2006
Ubiquitous computing and smart environments › mobile computing
mobile phone use
0.112006
Farther Than You May Think: An Empirical Investigation of the Proximity of Users to Their Mobile Phones · UbiComp 2006
Human-robot interaction › multi-robot systems › spatial formation
user proximity
0.112006
Farther Than You May Think: An Empirical Investigation of the Proximity of Users to Their Mobile Phones · UbiComp 2006
Internet architecture and protocols
network topology
0.012004
MACEDON: Methodology for Automatically Creating, Evaluating, and Designing Overlay Networks · NSDI 2004
Internet architecture and protocols › overlay networks
overlay construction
0.012004
MACEDON: Methodology for Automatically Creating, Evaluating, and Designing Overlay Networks · NSDI 2004
Distributed systems › peer-to-peer systems
overlay networks
0.012004
MACEDON: Methodology for Automatically Creating, Evaluating, and Designing Overlay Networks · NSDI 2004
Distributed systems › peer-to-peer systems › overlay networks
overlay network design
0.012004
MACEDON: Methodology for Automatically Creating, Evaluating, and Designing Overlay Networks · NSDI 2004
Empirical software engineering › developer studies
user study
0.012006
Farther Than You May Think: An Empirical Investigation of the Proximity of Users to Their Mobile Phones · UbiComp 2006

Methods — techniques the papers use, named apart from their topics

reinforcement learning · 0.2type theory · 0.1probability theory · 0.1simulation · 0.1optimization · 0.1target trajectory distribution · 0.1
YearPublicationVenuePosition
2017 Deriving Probability Density Functions from Probabilistic Functional Programs
abstract
The probability density function of a probability distribution is a fundamental concept in probability theory and a key ingredient in various widely used machine learning methods. However, the necessary framework for compiling probabilistic functional programs to density functions has only recently been developed. In this work, we present a density compiler for a probabilistic language with failure and both discrete and continuous distributions, and provide a proof of its soundness. The compiler greatly reduces the development effort of domain experts, which we demonstrate by solving inference problems from various scientific applications, such as modelling the global carbon cycle, using a standard Markov chain Monte Carlo framework.
Sooraj Bhat, Johannes Borgström, Andrew D. Gordon 0001, Claudio V. Russo
Log. Methods Comput. Sci.1
2013 Deriving Probability Density Functions from Probabilistic Functional Programs
Sooraj Bhat, Johannes Borgström, Andrew D. Gordon 0001, Claudio V. Russo
TACAS1
2012 A type theory for probability density functions
abstract
There has been great interest in creating probabilistic programming languages to simplify the coding of statistical tasks; however, there still does not exist a formal language that simultaneously provides (1) continuous probability distributions, (2) the ability to naturally express custom probabilistic models, and (3) probability density functions (PDFs). This collection of features is necessary for mechanizing fundamental statistical techniques. We formalize the first probabilistic language that exhibits these features, and it serves as a foundational framework for extending the ideas to more general languages. Particularly novel are our type system for absolutely continuous (AC) distributions (those which permit PDFs) and our PDF calculation procedure, which calculates PDF s for a large class of AC distributions. Our formalization paves the way toward the rigorous encoding of powerful statistical reformulations.
Sooraj Bhat, Ashish Agarwal, Richard W. Vuduc, Alexander G. Gray
POPL1
2010 Automating Mathematical Program Transformations
Ashish Agarwal, Sooraj Bhat, Alexander G. Gray, Ignacio E. Grossmann
PADL2
2008 Towards adaptive programming: integrating reinforcement learning into a programming language
abstract
Current programming languages and software engineering paradigms are proving insufficient for building intelligent multi-agent systems--such as interactive games and narratives--where developers are called upon to write increasingly complex behavior for agents in dynamic environments. A promising solution is to build adaptive systems; that is, to develop software written specifically to adapt to its environment by changing its behavior in response to what it observes in the world. In this paper we describe a new programming language, An Adaptive Behavior Language (A2BL), that implements adaptive programming primitives to support partial programming, a paradigm in which a programmer need only specify the details of behavior known at code-writing time, leaving the run-time system to learn the rest. Partial programming enables programmers to more easily encode software agents that are difficult to write in existing languages that do not offer language-level support for adaptivity. We motivate the use of partial programming with an example agent coded in a cutting-edge, but non-adaptive agent programming language (ABL), and show how A2BL can encode the same agent much more naturally.
Christopher L. Simpkins, Sooraj Bhat, Charles L. Isbell Jr., Michael Mateas
OOPSLA2
2007 Authorial Idioms for Target Distributions in TTD-MDPs
David L. Roberts 0001, Sooraj Bhat, Kenneth St. Clair, Charles L. Isbell Jr.
AAAI2
2006 On the Difficulty of Modular Reinforcement Learning for Real-World Partial Programming
Sooraj Bhat, Charles L. Isbell Jr., Michael Mateas
AAAI1
2006 Farther Than You May Think: An Empirical Investigation of the Proximity of Users to Their Mobile Phones
Shwetak N. Patel, Julie A. Kientz, Gillian R. Hayes, Sooraj Bhat, Gregory D. Abowd
UbiComp4
2004 MACEDON: Methodology for Automatically Creating, Evaluating, and Designing Overlay Networks
Adolfo Rodriguez, Chip Killian, Sooraj Bhat, Dejan Kostic, Amin Vahdat
NSDI3