default search action
Lin Chen 0003
Person information
- unicode name: 陈林
- affiliation: Yale University, New Haven, Connecticut, USA
- affiliation: Peking University, China
Other persons with the same name
- Lin Chen — disambiguation page
- Lin Chen 0001 — Fundamental Research Laboratory, Los Angeles, CA, USA (and 1 more)
- Lin Chen 0002
— Sun Yat-sen (Zhongshan) University, China (and 3 more)
- Lin Chen 0004 — Research Center Jülich, Germany
- Lin Chen 0005 — Xi'an Institute of Post & Telecommunications, China
- Lin Chen 0006
- Lin Chen 0007 — Elizabeth City State University, Department of Mathematics and Computer Science, Elizabeth City, NC, USA (and 1 more)
- Lin Chen 0008 — Ministry of Education, Hunan University, Changsha, China
- Lin Chen 0009
- Lin Chen 0010
- Lin Chen 0012 — Queensland University of Technology, Brisbane, QLD, Australia
- Lin Chen 0013
- Lin Chen 0014
- Lin Chen 0015
- Lin Chen 0016
- Lin Chen 0017
- Lin Chen 0018
- Lin Chen 0019
- Lin Chen 0020
- Lin Chen 0021
- Lin Chen 0022 — Leipzig University, Germany
- Lin Chen 0023
- Lin Chen 0024
- Lin Chen 0025 — University of Hong Kong
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [c33]Ruitu Xu, Lin Chen, Amin Karbasi:
Meta Learning in the Continuous Time Limit. AISTATS 2021: 3052-3060 - [c32]Lin Chen, Yifei Min, Mikhail Belkin, Amin Karbasi:
Multiple Descent: Design Your Own Generalization Curve. NeurIPS 2021: 8898-8912 - [c31]Yifei Min, Lin Chen, Amin Karbasi:
The curious case of adversarially robust models: More data can help, double descend, or hurt generalization. UAI 2021: 129-139 - 2020
- [c30]Lin Chen, Mingrui Zhang, Hamed Hassani, Amin Karbasi:
Black Box Submodular Maximization: Discrete and Continuous Settings. AISTATS 2020: 1058-1070 - [c29]Mingrui Zhang, Lin Chen, Aryan Mokhtari, Hamed Hassani, Amin Karbasi:
Quantized Frank-Wolfe: Faster Optimization, Lower Communication, and Projection Free. AISTATS 2020: 3696-3706 - [c28]Yuanxing Zhang
Preference-Aware Mask for Session-Based Recommendation with Bidirectional Transformer. ICASSP 2020: 3412-3416 - [c27]Lin Chen, Yifei Min, Mingrui Zhang, Amin Karbasi:
More Data Can Expand The Generalization Gap Between Adversarially Robust and Standard Models. ICML 2020: 1670-1680 - [c26]Lin Chen, Qian Yu, Hannah Lawrence, Amin Karbasi:
Minimax Regret of Switching-Constrained Online Convex Optimization: No Phase Transition. NeurIPS 2020 - [i22]Lin Chen, Yifei Min, Mingrui Zhang, Amin Karbasi:
More Data Can Expand the Generalization Gap Between Adversarially Robust and Standard Models. CoRR abs/2002.04725 (2020) - [i21]Yifei Min, Lin Chen, Amin Karbasi:
The Curious Case of Adversarially Robust Models: More Data Can Help, Double Descend, or Hurt Generalization. CoRR abs/2002.11080 (2020) - [i20]Ruitu Xu, Lin Chen, Amin Karbasi:
Meta Learning in the Continuous Time Limit. CoRR abs/2006.10921 (2020) - [i19]Lin Chen, Yifei Min, Mikhail Belkin, Amin Karbasi:
Multiple Descent: Design Your Own Generalization Curve. CoRR abs/2008.01036 (2020)
2010 – 2019
- 2019
- [c25]Lin Chen, Mingrui Zhang, Amin Karbasi:
Projection-Free Bandit Convex Optimization. AISTATS 2019: 2047-2056 - [c24]Yushuo Guan, Yuanxing Zhang
A Neural Attack Model for Cracking Passwords in Adversarial Environments. ICCC 2019: 183-188 - [c23]Mingrui Zhang, Lin Chen, Hamed Hassani, Amin Karbasi:
Online Continuous Submodular Maximization: From Full-Information to Bandit Feedback. NeurIPS 2019: 9206-9217 - [c22]Lin Chen, Moran Feldman, Amin Karbasi:
Unconstrained submodular maximization with constant adaptive complexity. STOC 2019: 102-113 - [i18]Lin Chen, Mingrui Zhang, Hamed Hassani, Amin Karbasi:
Black Box Submodular Maximization: Discrete and Continuous Settings. CoRR abs/1901.09515 (2019) - [i17]Kaigui Bian, Lin Chen, Yuanxing Zhang
Heterogeneous Coexistence of Cognitive Radio Networks in TV White Space. CoRR abs/1902.06035 (2019) - [i16]Mingrui Zhang, Lin Chen, Aryan Mokhtari, Hamed Hassani, Amin Karbasi:
Quantized Frank-Wolfe: Communication-Efficient Distributed Optimization. CoRR abs/1902.06332 (2019) - [i15]Lin Chen, Qian Yu, Hannah Lawrence, Amin Karbasi:
Minimax Regret of Switching-Constrained Online Convex Optimization: No Phase Transition. CoRR abs/1910.10873 (2019) - [i14]Mingrui Zhang, Lin Chen, Hamed Hassani, Amin Karbasi:
Online Continuous Submodular Maximization: From Full-Information to Bandit Feedback. CoRR abs/1910.12424 (2019) - 2018
- [j4]Lin Chen, Ruolin Fan, Yangbin Zhang, Shuyu Shi, Kaigui Bian
On heterogeneous duty cycles for neighbor discovery in wireless sensor networks. Ad Hoc Networks 77: 54-68 (2018) - [j3]Shuyu Shi
Accurate Location Tracking From CSI-Based Passive Device-Free Probabilistic Fingerprinting. IEEE Trans. Veh. Technol. 67(6): 5217-5230 (2018) - [c21]Ehsan Kazemi, Lin Chen, Sanjoy Dasgupta, Amin Karbasi:
Comparison Based Learning from Weak Oracles. AISTATS 2018: 1849-1858 - [c20]Lin Chen, Hamed Hassani, Amin Karbasi:
Online Continuous Submodular Maximization. AISTATS 2018: 1896-1905 - [c19]Yuanxing Zhang
Early Detection of Rumors in Heterogeneous Mobile Social Network. DSC 2018: 294-301 - [c18]Yuanxing Zhang
Enabling Symbiotic Coexistence of Heterogeneous Cognitive Radio Networks. DySPAN 2018: 1-5 - [c17]Lin Chen, Moran Feldman, Amin Karbasi:
Weakly Submodular Maximization Beyond Cardinality Constraints: Does Randomization Help Greedy? ICML 2018: 803-812 - [c16]Lin Chen, Christopher Harshaw, Hamed Hassani, Amin Karbasi:
Projection-Free Online Optimization with Stochastic Gradient: From Convexity to Submodularity. ICML 2018: 813-822 - [i13]Lin Chen, Hamed Hassani, Amin Karbasi:
Online Continuous Submodular Maximization. CoRR abs/1802.06052 (2018) - [i12]Ehsan Kazemi, Lin Chen, Sanjoy Dasgupta, Amin Karbasi:
Comparison Based Learning from Weak Oracles. CoRR abs/1802.06942 (2018) - [i11]Lin Chen, Mingrui Zhang, Amin Karbasi:
Projection-Free Bandit Convex Optimization. CoRR abs/1805.07474 (2018) - [i10]Lin Chen, Moran Feldman, Amin Karbasi:
Unconstrained Submodular Maximization with Constant Adaptive Complexity. CoRR abs/1811.06603 (2018) - 2017
- [c15]Lin Chen, Seyed Hamed Hassani, Amin Karbasi:
Near-Optimal Active Learning of Halfspaces via Query Synthesis in the Noisy Setting. AAAI 2017: 1798-1804 - [c14]Yangbin Zhang, Kaigui Bian, Lin Chen, Pan Zhou, Xiaoming Li:
Dynamic Slot-Length Control for Reducing Neighbor Discovery Latency in Wireless Sensor Networks. GLOBECOM 2017: 1-6 - [c13]Lin Chen, Andreas Krause, Amin Karbasi:
Interactive Submodular Bandit. NIPS 2017: 141-152 - [c12]Lin Chen, Forrest W. Crawford, Amin Karbasi:
Submodular Variational Inference for Network Reconstruction. UAI 2017 - [i9]Lin Chen, Moran Feldman, Amin Karbasi:
Weakly Submodular Maximization Beyond Cardinality Constraints: Does Randomization Help Greedy? CoRR abs/1707.04347 (2017) - 2016
- [c11]Lin Chen, Forrest W. Crawford, Amin Karbasi:
Seeing the Unseen Network: Inferring Hidden Social Ties from Respondent-Driven Sampling. AAAI 2016: 1174-1180 - [c10]Yuanxing Zhang
Influence Maximization in Messenger-Based Social Networks. GLOBECOM 2016: 1-6 - [c9]Zhuqi Li, Lin Chen, Yichong Bai, Kaigui Bian, Pan Zhou:
On diffusion-restricted social network: A measurement study of WeChat moments. ICC 2016: 1-6 - [c8]Lin Chen, Amin Karbasi, Forrest W. Crawford:
Estimating the Size of a Large Network and its Communities from a Random Sample. NIPS 2016: 3072-3080 - [c7]Lin Chen, Zhiping Xiao
Skolem Sequence Based Self-Adaptive Broadcast Protocol in Cognitive Radio Networks. VTC Spring 2016: 1-5 - [i8]Lin Chen, Zhiping Xiao, Kaigui Bian, Shuyu Shi, Rui Li, Yusheng Ji:
Skolem Sequence Based Self-adaptive Broadcast Protocol in Cognitive Radio Networks. CoRR abs/1602.00066 (2016) - [i7]Zhuqi Li, Lin Chen, Yichong Bai, Kaigui Bian, Pan Zhou:
On Diffusion-restricted Social Network: A Measurement Study of WeChat Moments. CoRR abs/1602.00193 (2016) - [i6]Lin Chen, S. Hamed Hassani, Amin Karbasi:
Dimension Coupling: Optimal Active Learning of Halfspaces via Query Synthesis. CoRR abs/1603.03515 (2016) - [i5]Lin Chen, Amin Karbasi, Forrest W. Crawford:
Submodular Variational Inference for Network Reconstruction. CoRR abs/1603.08616 (2016) - [i4]Lin Chen, Amin Karbasi, Forrest W. Crawford:
Estimating the Size of a Large Network and its Communities from a Random Sample. CoRR abs/1610.08473 (2016) - 2015
- [j2]Lin Chen, Kaigui Bian, Xiaojiang Du, Xiaoming Li:
Multichannel Broadcast Via Channel Hopping in Cognitive Radio Networks. IEEE Trans. Veh. Technol. 64(7): 3004-3017 (2015) - [c6]Shuyu Shi, Lin Chen, Wenjun Hu, Marco Gruteser:
Reading between lines: high-rate, non-intrusive visual codes within regular videos via ImplicitCode. UbiComp 2015: 157-168 - [c5]Hongji Yang, Lin Chen, Kaigui Bian, Yang Tian, Fan Ye, Wei Yan, Tong Zhao, Xiaoming Li:
TapLock: Exploit finger tap events for enhancing attack resilience of smartphone passwords. ICC 2015: 7139-7144 - [c4]Lin Chen, Shuyu Shi, Kaigui Bian, Yusheng Ji:
Optimizing average-maximum TTR trade-off for cognitive radio rendezvous. ICC 2015: 7707-7712 - [c3]Lin Chen, Ruolin Fan, Kaigui Bian, Lin Chen, Mario Gerla, Tao Wang, Xiaoming Li:
On heterogeneous neighbor discovery in wireless sensor networks. INFOCOM 2015: 693-701 - [i3]Lin Chen, Shuyu Shi, Kaigui Bian, Yusheng Ji:
Optimizing Average-Maximum TTR Trade-off for Cognitive Radio Rendezvous. CoRR abs/1502.03469 (2015) - [i2]Lin Chen, Forrest W. Crawford, Amin Karbasi:
Seeing the Unseen Network: Inferring Hidden Social Ties from Respondent-Driven Sampling. CoRR abs/1511.04137 (2015) - 2014
- [j1]Kaigui Bian, Jung-Min Park, Lin Chen, Xiaoming Li:
Addressing the Hidden Terminal Problem for Heterogeneous Coexistence Between TDM and CSMA Networks in White Space. IEEE Trans. Veh. Technol. 63(9): 4450-4463 (2014) - [c2]Lin Chen, Kaigui Bian, Lin Chen, Cong Liu, Jung-Min "Jerry" Park, Xiaoming Li:
A group-theoretic framework for rendezvous in heterogeneous cognitive radio networks. MobiHoc 2014: 165-174 - [i1]Lin Chen, Ruolin Fan, Kaigui Bian, Lin Chen, Mario Gerla, Tao Wang, Xiaoming Li:
On Heterogeneous Neighbor Discovery in Wireless Sensor Networks. CoRR abs/1411.5415 (2014) - 2013
- [c1]Lin Chen, Kaigui Bian, Lin Chen, Wei Yan, Xiaoming Li:
On the cascading spectrum contention problem in self-coexistence of cognitive radio networks. CRAB@MobiCom 2013: 3-12
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-12-17 21:00 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: