default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChun Kai Ling
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c19]Yixuan Even Xu, Chun Kai Ling, Fei Fang:
Learning Coalition Structures with Games. AAAI 2024: 9944-9951- [c18]Weijia Zhang, Chun Kai Ling, Xuanhui Zhang:
Deep Copula-Based Survival Analysis for Dependent Censoring with Identifiability Guarantees. AAAI 2024: 20613-20621 - [c17]Jakub Cerný, Chun Kai Ling, Darshan Chakrabarti, Jingwen Zhang, Gabriele Farina, Christian Kroer, Garud Iyengar:
Contested Logistics: A Game-Theoretic Approach. GameSec 2024: 124-146 - [c16]Paul Pu Liang, Chun Kai Ling, Yun Cheng, Alexander Obolenskiy, Yudong Liu, Rohan Pandey, Alex Wilf, Louis-Philippe Morency, Russ Salakhutdinov:
Multimodal Learning Without Labeled Multimodal Data: Guarantees and Applications. ICLR 2024 - [c15]Davin Choo, Themistoklis Gouleakis, Chun Kai Ling, Arnab Bhattacharyya:
Online bipartite matching with imperfect advice. ICML 2024 - [c14]Jakub Cerný, Chun Kai Ling, Christian Kroer, Garud Iyengar:
Layered Graph Security Games. IJCAI 2024: 2695-2703 - [i20]Jakub Cerný, Chun Kai Ling, Christian Kroer, Garud Iyengar:
Layered Graph Security Games. CoRR abs/2405.03070 (2024) - [i19]Davin Choo, Themis Gouleakis, Chun Kai Ling, Arnab Bhattacharyya:
Online bipartite matching with imperfect advice. CoRR abs/2405.09784 (2024) - [i18]Jakub Cerný, Chun Kai Ling, Darshan Chakrabarti, Jingwen Zhang, Gabriele Farina, Christian Kroer, Garud Iyengar:
Contested Logistics: A Game-Theoretic Approach. CoRR abs/2408.13057 (2024) - [i17]Davin Choo, Chun Kai Ling:
A short note about the learning-augmented secretary problem. CoRR abs/2410.06583 (2024) - 2023
- [c13]Chun Kai Ling, J. Zico Kolter, Fei Fang:
Function Approximation for Solving Stackelberg Equilibrium in Large Perfect Information Games. AAAI 2023: 5764-5772 - [c12]Zimeng Song, Chun Kai Ling, Fei Fang:
Multi-defender Security Games with Schedules. GameSec 2023: 65-85 - [c11]Samuel Sokota, Ryan D'Orazio, Chun Kai Ling, David J. Wu, J. Zico Kolter, Noam Brown:
Abstracting Imperfect Information Away from Two-Player Zero-Sum Games. ICML 2023: 32169-32193 - [c10]Paul Pu Liang, Yun Cheng, Xiang Fan, Chun Kai Ling, Suzanne Nie, Richard J. Chen, Zihao Deng, Nicholas B. Allen, Randy Auerbach, Faisal Mahmood, Russ Salakhutdinov, Louis-Philippe Morency:
Quantifying & Modeling Multimodal Interactions: An Information Decomposition Framework. NeurIPS 2023 - [i16]Samuel Sokota, Ryan D'Orazio, Chun Kai Ling, David J. Wu, J. Zico Kolter, Noam Brown:
Abstracting Imperfect Information Away from Two-Player Zero-Sum Games. CoRR abs/2301.09159 (2023) - [i15]Paul Pu Liang, Yun Cheng, Xiang Fan, Chun Kai Ling, Suzanne Nie, Richard J. Chen, Zihao Deng, Faisal Mahmood, Ruslan Salakhutdinov, Louis-Philippe Morency:
Quantifying & Modeling Feature Interactions: An Information Decomposition Framework. CoRR abs/2302.12247 (2023) - [i14]Paul Pu Liang, Chun Kai Ling, Yun Cheng, Alex Obolenskiy, Yudong Liu, Rohan Pandey, Alex Wilf, Louis-Philippe Morency, Ruslan Salakhutdinov:
Multimodal Learning Without Labeled Multimodal Data: Guarantees and Applications. CoRR abs/2306.04539 (2023) - [i13]Zimeng Song, Chun Kai Ling, Fei Fang:
Multi-defender Security Games with Schedules. CoRR abs/2311.16392 (2023) - [i12]Yixuan Even Xu, Chun Kai Ling, Fei Fang:
Learning Coalition Structures with Games. CoRR abs/2312.09058 (2023) - [i11]Weijia Zhang, Chun Kai Ling, Xuanhui Zhang:
Deep Copula-Based Survival Analysis for Dependent Censoring with Identifiability Guarantees. CoRR abs/2312.15566 (2023) - 2022
- [c9]Chun Kai Ling, Fei Fang:
Safe Subgame Resolving for Extensive Form Correlated Equilibrium. AAAI 2022: 5116-5123 - [i10]Chun Kai Ling, Fei Fang
:
Safe Subgame Resolving for Extensive Form Correlated Equilibrium. CoRR abs/2212.14317 (2022) - [i9]Chun Kai Ling, J. Zico Kolter, Fei Fang:
Function Approximation for Solving Stackelberg Equilibrium in Large Perfect Information Games. CoRR abs/2212.14431 (2022) - 2021
- [c8]Chun Kai Ling, Noam Brown:
Safe Search for Stackelberg Equilibria in Extensive-Form Games. AAAI 2021: 5541-5548 - [i8]Chun Kai Ling, Noam Brown:
Safe Search for Stackelberg Equilibria in Extensive-Form Games. CoRR abs/2102.01775 (2021) - 2020
- [c7]Dmitrii Kharkovskii, Chun Kai Ling, Bryan Kian Hsiang Low:
Nonmyopic Gaussian Process Optimization with Macro-Actions. AISTATS 2020: 4593-4604 - [c6]Chun Kai Ling, Fei Fang, J. Zico Kolter:
Deep Archimedean Copulas. NeurIPS 2020 - [i7]Dmitrii Kharkovskii, Chun Kai Ling, Kian Hsiang Low:
Nonmyopic Gaussian Process Optimization with Macro-Actions. CoRR abs/2002.09670 (2020) - [i6]Chun Kai Ling, Fei Fang, J. Zico Kolter:
Deep Archimedean Copulas. CoRR abs/2012.03137 (2020)
2010 – 2019
- 2019
- [c5]Chun Kai Ling, Fei Fang, J. Zico Kolter:
Large Scale Learning of Agent Rationality in Two-Player Zero-Sum Games. AAAI 2019: 6104-6111 - [c4]Gabriele Farina, Chun Kai Ling, Fei Fang, Tuomas Sandholm:
Efficient Regret Minimization Algorithm for Extensive-Form Correlated Equilibrium. NeurIPS 2019: 5187-5197 - [c3]Gabriele Farina, Chun Kai Ling, Fei Fang, Tuomas Sandholm:
Correlation in Extensive-Form Games: Saddle-Point Formulation and Benchmarks. NeurIPS 2019: 9229-9239 - [i5]Chun Kai Ling, Fei Fang, J. Zico Kolter:
Large Scale Learning of Agent Rationality in Two-Player Zero-Sum Games. CoRR abs/1903.04101 (2019) - [i4]Gabriele Farina, Chun Kai Ling, Fei Fang, Tuomas Sandholm:
Correlation in Extensive-Form Games: Saddle-Point Formulation and Benchmarks. CoRR abs/1905.12564 (2019) - [i3]Gabriele Farina, Chun Kai Ling, Fei Fang, Tuomas Sandholm:
Efficient Regret Minimization Algorithm for Extensive-Form Correlated Equilibrium. CoRR abs/1910.12450 (2019) - 2018
- [c2]Chun Kai Ling, Fei Fang, J. Zico Kolter:
What Game Are We Playing? End-to-end Learning in Normal and Extensive Form Games. IJCAI 2018: 396-402 - [i2]Chun Kai Ling, Fei Fang, J. Zico Kolter:
What game are we playing? End-to-end learning in normal and extensive form games. CoRR abs/1805.02777 (2018) - 2016
- [c1]Chun Kai Ling, Kian Hsiang Low, Patrick Jaillet:
Gaussian Process Planning with Lipschitz Continuous Reward Functions: Towards Unifying Bayesian Optimization, Active Learning, and Beyond. AAAI 2016: 1860-1866 - 2015
- [i1]Chun Kai Ling, Kian Hsiang Low, Patrick Jaillet:
Gaussian Process Planning with Lipschitz Continuous Reward Functions: Towards Unifying Bayesian Optimization, Active Learning, and Beyond. CoRR abs/1511.06890 (2015)
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-19 20:48 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:
