no code implementations • 27 Aug 2021 • Siddarth Srinivasan, Jamie Morgenstern
The revenue raised in the submission stage auction is used to pay reviewers based on the quality of their reviews in the reviewing stage.
no code implementations • 20 Oct 2020 • Siddarth Srinivasan, Sandesh Adhikary, Jacob Miller, Guillaume Rabusseau, Byron Boots
We address this gap by showing how stationary or uniform versions of popular quantum tensor network models have equivalent representations in the stochastic processes and weighted automata literature, in the limit of infinitely long sequences.
1 code implementation • ICLR 2021 • Liyuan Xu, Yutian Chen, Siddarth Srinivasan, Nando de Freitas, Arnaud Doucet, Arthur Gretton
We propose a novel method, deep feature instrumental variable regression (DFIV), to address the case where relations between instruments, treatments, and outcomes may be nonlinear.
no code implementations • 2 Dec 2019 • Sandesh Adhikary, Siddarth Srinivasan, Geoff Gordon, Byron Boots
Extending classical probabilistic reasoning using the quantum mechanical view of probability has been of recent interest, particularly in the development of hidden quantum Markov models (HQMMs) to model stochastic processes.
no code implementations • 9 Mar 2019 • Sandesh Adhikary, Siddarth Srinivasan, Byron Boots
Quantum graphical models (QGMs) extend the classical framework for reasoning about uncertainty by incorporating the quantum mechanical view of probability.
no code implementations • NeurIPS 2018 • Siddarth Srinivasan, Carlton Downey, Byron Boots
Unlike classical graphical models, QGMs represent uncertainty with density matrices in complex Hilbert spaces.
no code implementations • NAACL 2018 • Siddarth Srinivasan, Richa Arora, Mark Riedl
In the Story Cloze Test, a system is presented with a 4-sentence prompt to a story, and must determine which one of two potential endings is the 'right' ending to the story.
Ranked #15 on Question Answering on StoryCloze
no code implementations • 24 Oct 2017 • Siddarth Srinivasan, Geoff Gordon, Byron Boots
We extend previous work on HQMMs with three contributions: (1) we show how classical hidden Markov models (HMMs) can be simulated on a quantum circuit, (2) we reformulate HQMMs by relaxing the constraints for modeling HMMs on quantum circuits, and (3) we present a learning algorithm to estimate the parameters of an HQMM from data.