default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChristopher J. Quinn
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c25]Fares Fourati
, Christopher John Quinn, Mohamed-Slim Alouini, Vaneet Aggarwal:
Combinatorial Stochastic-Greedy Bandit. AAAI 2024: 12052-12060- [c24]Daoping Wu, Suhas Gundimeda, Shaoshuai Mou, Christopher J. Quinn:
Unsupervised Change Point Detection in Multivariate Time Series. AISTATS 2024: 3844-3852 - [c23]Mohammad Pedramfar, Yididiya Y. Nadew, Christopher John Quinn, Vaneet Aggarwal:
Unified Projection-Free Algorithms for Adversarial DR-Submodular Optimization. ICLR 2024 - [c22]Yididiya Y. Nadew, Xuhui Fan, Christopher John Quinn:
Conditionally-Conjugate Gaussian Process Factor Analysis for Spike Count Data via Data Augmentation. ICML 2024 - [i12]Mohammad Pedramfar, Yididiya Y. Nadew, Christopher J. Quinn, Vaneet Aggarwal:
Unified Projection-Free Algorithms for Adversarial DR-Submodular Optimization. CoRR abs/2403.10063 (2024) - [i11]Yididiya Y. Nadew, Xuhui Fan, Christopher J. Quinn:
Conditionally-Conjugate Gaussian Process Factor Analysis for Spike Count Data via Data Augmentation. CoRR abs/2405.11683 (2024) - [i10]Hui Chen, Hengyu Liu, Yaqiong Li, Xuhui Fan, Zhilin Zhao, Feng Zhou, Christopher John Quinn, Longbing Cao:
Federated Neural Nonparametric Point Processes. CoRR abs/2410.05637 (2024) - 2023
- [j8]Abhishek K. Umrawal, Christopher J. Quinn, Vaneet Aggarwal:
A Community-Aware Framework for Social Influence Maximization. IEEE Trans. Emerg. Top. Comput. Intell. 7(4): 1253-1262 (2023) - [c21]Fares Fourati, Vaneet Aggarwal, Christopher J. Quinn, Mohamed-Slim Alouini:
Randomized Greedy Learning for Non-monotone Stochastic Submodular Maximization Under Full-bandit Feedback. AISTATS 2023: 7455-7471 - [c20]Abhishek K. Umrawal, Vaneet Aggarwal, Christopher J. Quinn:
Fractional Budget Allocation for Influence Maximization. CDC 2023: 4327-4332 - [c19]Guanyu Nie, Yididiya Y. Nadew, Yanhui Zhu, Vaneet Aggarwal, Christopher John Quinn:
A Framework for Adapting Offline Algorithms to Solve Combinatorial Multi-Armed Bandit Problems with Bandit Feedback. ICML 2023: 26166-26198 - [c18]Mohammad Pedramfar, Christopher J. Quinn, Vaneet Aggarwal:
A Unified Approach for Maximizing Continuous DR-submodular Functions. NeurIPS 2023 - [c17]Guanyu Nie, Yanhui Zhu, Yididiya Y. Nadew, Samik Basu, A. Pavan, Christopher John Quinn:
Size-constrained k-submodular maximization in near-linear time. UAI 2023: 1545-1554 - [i9]Guanyu Nie, Yididiya Y. Nadew, Yanhui Zhu, Vaneet Aggarwal, Christopher John Quinn:
A Framework for Adapting Offline Algorithms to Solve Combinatorial Multi-Armed Bandit Problems with Bandit Feedback. CoRR abs/2301.13326 (2023) - [i8]Fares Fourati, Vaneet Aggarwal, Christopher John Quinn, Mohamed-Slim Alouini:
Randomized Greedy Learning for Non-monotone Stochastic Submodular Maximization Under Full-bandit Feedback. CoRR abs/2302.01324 (2023) - [i7]Mohammad Pedramfar, Christopher John Quinn, Vaneet Aggarwal:
A Unified Approach for Maximizing Continuous DR-submodular Functions. CoRR abs/2305.16671 (2023) - [i6]Fares Fourati, Christopher John Quinn, Mohamed-Slim Alouini, Vaneet Aggarwal:
Combinatorial Stochastic-Greedy Bandit. CoRR abs/2312.08057 (2023) - 2022
- [c16]Guanyu Nie, Mridul Agarwal, Abhishek Kumar Umrawal, Vaneet Aggarwal, Christopher John Quinn:
An explore-then-commit algorithm for submodular maximization under full-bandit feedback. UAI 2022: 1541-1551 - 2021
- [j7]Mridul Agarwal, Vaneet Aggarwal, Abhishek K. Umrawal, Christopher J. Quinn:
Stochastic Top K-Subset Bandits with Linear Space and Non-Linear Feedback with Applications to Social Influence Maximization. Trans. Data Sci. 2(4): 38:1-38:39 (2021) - [c15]Mridul Agarwal, Vaneet Aggarwal, Abhishek Kumar Umrawal, Christopher J. Quinn:
DART: Adaptive Accept Reject Algorithm for Non-Linear Combinatorial Bandits. AAAI 2021: 6557-6565 - [c14]Mridul Agarwal, Vaneet Aggarwal, Christopher J. Quinn, Abhishek K. Umrawal:
Stochastic Top-K Subset Bandits with Linear Space and Non-Linear Feedback. ALT 2021: 306-339 - [c13]Xueyan Niu, Christopher J. Quinn:
Information Flow in Markov Chains. CDC 2021: 3442-3447 - 2020
- [c12]Daoping Wu, Suhas Gundimeda, Shaoshuai Mou, Christopher J. Quinn:
Modeling Piece-Wise Stationary Time Series. ICASSP 2020: 3817-3821 - [c11]Xueyan Niu, Christopher J. Quinn:
Synergy and Redundancy Duality Between Gaussian Multiple Access and Broadcast Channels. ISITA 2020: 6-10 - [i5]Mridul Agarwal, Vaneet Aggarwal, Christopher J. Quinn, Abhishek K. Umrawal:
DART: aDaptive Accept RejecT for non-linear top-K subset identification. CoRR abs/2011.07687 (2020)
2010 – 2019
- 2019
- [c10]Xueyan Niu, Christopher J. Quinn:
A Measure of Synergy, Redundancy, and Unique Information using Information Geometry. ISIT 2019: 3127-3131 - 2017
- [j6]Christopher J. Quinn, Ali Pinar, Negar Kiyavash:
Bounded-Degree Connected Approximations of Stochastic Networks. IEEE Trans. Mol. Biol. Multi Scale Commun. 3(2): 79-88 (2017) - 2016
- [c9]Christopher J. Quinn:
On sparse approximations for time-series networks. Allerton 2016: 1322-1326 - [c8]Christopher J. Quinn, Ali Pinar, Jing Gao, Lu Su:
Sparse approximations of directed information graphs. ISIT 2016: 1735-1739 - [c7]Qi Li, Fenglong Ma, Jing Gao, Lu Su, Christopher J. Quinn:
Crowdsourcing High Quality Labels with a Tight Budget. WSDM 2016: 237-246 - 2015
- [j5]Christopher J. Quinn, Negar Kiyavash, Todd P. Coleman:
Directed Information Graphs. IEEE Trans. Inf. Theory 61(12): 6887-6909 (2015) - [i4]Christopher J. Quinn, Ali Pinar, Negar Kiyavash:
Bounded Degree Approximations of Stochastic Networks. CoRR abs/1506.04767 (2015) - 2014
- [b1]Christopher John Quinn:
Identification and approximation of the structure of networks of stochastic processes. University of Illinois Urbana-Champaign, USA, 2014 - [j4]Sanggyun Kim, Christopher J. Quinn, Negar Kiyavash, Todd P. Coleman:
Dynamic and Succinct Statistical Analysis of Neuroscience Data. Proc. IEEE 102(5): 683-698 (2014) - 2013
- [j3]Dustin G. Mixon, Christopher J. Quinn, Negar Kiyavash, Matthew Fickus:
Fingerprinting With Equiangular Tight Frames. IEEE Trans. Inf. Theory 59(3): 1855-1865 (2013) - [j2]Christopher J. Quinn, Negar Kiyavash, Todd P. Coleman:
Efficient Methods to Compute Optimal Tree Approximations of Directed Information Graphs. IEEE Trans. Signal Process. 61(12): 3173-3182 (2013) - [c6]Christopher J. Quinn, Jalal Etesami, Negar Kiyavash, Todd P. Coleman:
Robust directed tree approximations for networks of stochastic processes. ISIT 2013: 2254-2258 - [c5]Christopher J. Quinn, Ali Pinar, Negar Kiyavash:
Optimal bounded-degree approximations of joint distributions of networks of stochastic processes. ISIT 2013: 2264-2268 - 2012
- [i3]Christopher J. Quinn, Negar Kiyavash, Todd P. Coleman:
Directed Information Graphs. CoRR abs/1204.2003 (2012) - 2011
- [j1]Christopher J. Quinn, Todd P. Coleman, Negar Kiyavash, Nicholas G. Hatsopoulos:
Estimating the directed information to infer causal relationships in ensemble neural spike train recordings. J. Comput. Neurosci. 30(1): 17-44 (2011) - [c4]Christopher J. Quinn, Negar Kiyavash, Todd P. Coleman:
A minimal approach to causal inference on topologies with bounded indegree. CDC/ECC 2011: 168-173 - [c3]Dustin G. Mixon, Christopher J. Quinn, Negar Kiyavash, Matthew Fickus:
Equiangular tight frame fingerprinting codes. ICASSP 2011: 1856-1859 - [c2]Christopher J. Quinn, Negar Kiyavash, Todd P. Coleman:
Equivalence between minimal generative model graphs and directed information graphs. ISIT 2011: 293-297 - [i2]Christopher J. Quinn, Todd P. Coleman, Negar Kiyavash:
Causal Dependence Tree Approximations of Joint Distributions for Multiple Random Processes. CoRR abs/1101.5108 (2011) - [i1]Dustin G. Mixon, Christopher J. Quinn, Negar Kiyavash, Matthew Fickus:
Fingerprinting with Equiangular Tight Frames. CoRR abs/1111.3376 (2011) - 2010
- [c1]Christopher J. Quinn, Todd P. Coleman, Negar Kiyavash:
Approximating discrete probability distributions with causal dependence trees. ISITA 2010: 100-105
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-20 21:55 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
