default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChi-Jen Lu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j28]Po-An Chen, Chi-Jen Lu, Chuang-Chieh Lin
, An-Tzu Teng, Ke-Wei Fu:
Multiagent learning for competitive opinion optimization. Theor. Comput. Sci. 1017: 114787 (2024)- 2023
- [j27]Chuang-Chieh Lin, Chih-Chieh Hung, Chi-Jen Lu, Po-An Chen:
Group Formation by Group Joining and Opinion Updates Via Multi-Agent Online Gradient Ascent [AI-eXplained]. IEEE Comput. Intell. Mag. 18(4): 60-61 (2023) - [c56]Chi-Hao Wang, Chi-Jen Lu, Ming-Tat Ko, Po-An Chen, Chuang-Chieh Lin:
Budget-Constrained Cost-Covering Job Assignment for a Total Contribution-Maximizing Platform. IWOCA 2023: 392-403 - [c55]Ruo-Chun Tzeng, Po-An Wang, Alexandre Proutière, Chi-Jen Lu:
Closing the Computational-Statistical Gap in Best Arm Identification for Combinatorial Semi-bandits. NeurIPS 2023 - [i15]Chuang-Chieh Lin, Chi-Jen Lu, Po-An Chen:
On the Efficiency of An Election Game of Two or More Parties: How Bad Can It Be? CoRR abs/2303.14405 (2023) - 2022
- [j26]Po-An Chen, Chi-Jen Lu, Yu-Sin Lu:
An Alternating Algorithm for Finding Linear Arrow-Debreu Market Equilibria. Theory Comput. Syst. 66(1): 38-55 (2022) - [c54]Ruo-Chun Tzeng, Po-An Wang, Florian Adriaens, Aristides Gionis, Chi-Jen Lu:
Improved analysis of randomized SVD for top-eigenvector approximation. AISTATS 2022: 2045-2072 - [c53]Po-An Chen, Chi-Jen Lu, Chuang-Chieh Lin, Ke-Wei Fu:
Multiagent Learning for Competitive Opinion Optimization (Extended Abstract). ICS 2022: 61-72 - [i14]Ruo-Chun Tzeng, Po-An Wang, Florian Adriaens, Aristides Gionis, Chi-Jen Lu:
Improved analysis of randomized SVD for top-eigenvector approximation. CoRR abs/2202.07992 (2022) - 2021
- [j25]Chuang-Chieh Lin, Chi-Jen Lu, Po-An Chen:
How good is a two-party election game? Theor. Comput. Sci. 871: 79-93 (2021) - [c52]Yi-Shan Wu, Yi-Te Hong, Chi-Jen Lu:
Lifelong Learning with Branching Experts. ACML 2021: 1161-1175 - [c51]Ting-Yun Chang, Chi-Jen Lu:
Rethinking Why Intermediate-Task Fine-Tuning Works. EMNLP (Findings) 2021: 706-713 - [i13]Ting-Yun Chang, Chi-Jen Lu:
Rethinking Why Intermediate-Task Fine-Tuning Works. CoRR abs/2108.11696 (2021) - 2020
- [c50]Ting-Yun Chang, Chi-Jen Lu:
TinyGAN: Distilling BigGAN for Conditional Image Generation. ACCV (4) 2020: 509-525 - [i12]Chuang-Chieh Lin, Chi-Jen Lu, Po-An Chen:
How Good Is a Two-Party Election Game? CoRR abs/2001.05692 (2020) - [i11]Ting-Yun Chang, Chi-Jen Lu:
TinyGAN: Distilling BigGAN for Conditional Image Generation. CoRR abs/2009.13829 (2020)
2010 – 2019
- 2019
- [c49]Yi-Shan Wu, Po-An Wang, Chi-Jen Lu:
Lifelong Optimization with Low Regret. AISTATS 2019: 448-456 - [c48]Jun-Kun Wang, Chi-Jen Lu, Shou-De Lin:
Online Linear Optimization with Sparsity Constraints. ALT 2019: 882-896 - [c47]Chih-Te Lai, Yi-Te Hong, Hong-You Chen, Chi-Jen Lu, Shou-De Lin:
Multiple Text Style Transfer by using Word-level Conditional Generative Adversarial Network with Two-Phase Training. EMNLP/IJCNLP (1) 2019: 3577-3582 - [c46]Hong-You Chen, Chi-Jen Lu:
Nested Variance Estimating VAE/GAN for Face Generation. IJCNN 2019: 1-8 - [c45]Chi-Ning Chou, Kai-Min Chung, Chi-Jen Lu:
On the Algorithmic Power of Spiking Neural Networks. ITCS 2019: 26:1-26:20 - [i10]Po-An Chen, Chi-Jen Lu:
An Alternating Algorithm for Finding Linear Arrow-Debreu Market Equilibrium. CoRR abs/1902.01754 (2019) - 2018
- [c44]Chuang-Chieh Lin, Chi-Jen Lu:
Efficient Mechanisms for Peer Grading and Dueling Bandits. ACML 2018: 740-755 - [c43]Jen-Hou Chou, Chi-Jen Lu:
The Communication Complexity of Graphical Games on Grid Graphs. WINE 2018: 111-125 - [i9]Po-An Chen, Chi-Jen Lu:
Playing Stackelberg Opinion Optimization with Randomized Algorithms for Combinatorial Strategies. CoRR abs/1803.01792 (2018) - [i8]Chi-Ning Chou, Kai-Min Chung, Chi-Jen Lu:
On the Algorithmic Power of Spiking Neural Networks. CoRR abs/1803.10375 (2018) - 2017
- [c42]Po-An Wang, Chi-Jen Lu:
Tensor Decomposition via Simultaneous Power Iteration. ICML 2017: 3665-3673 - [c41]Chen-Yu Wei, Yi-Te Hong, Chi-Jen Lu:
Online Reinforcement Learning in Stochastic Games. NIPS 2017: 4987-4997 - [i7]Chen-Yu Wei, Yi-Te Hong, Chi-Jen Lu:
Tracking the Best Expert in Non-stationary Stochastic Environments. CoRR abs/1712.00578 (2017) - [i6]Chen-Yu Wei, Yi-Te Hong, Chi-Jen Lu:
Online Reinforcement Learning in Stochastic Games. CoRR abs/1712.00579 (2017) - 2016
- [j24]Po-An Chen, Chi-Jen Lu:
Generalized mirror descents in congestion games. Artif. Intell. 241: 217-243 (2016) - [j23]Po-An Chen, Yi-Le Chen, Chi-Jen Lu:
Bounds on the price of anarchy for a more general class of directed graphs in opinion formation games. Oper. Res. Lett. 44(6): 808-811 (2016) - [c40]Chun-Liang Li, Hsuan-Tien Lin, Chi-Jen Lu:
Rivalry of Two Families of Algorithms for Memory-Restricted Streaming PCA. AISTATS 2016: 473-481 - [c39]Chen-Yu Wei, Yi-Te Hong, Chi-Jen Lu:
Tracking the Best Expert in Non-stationary Stochastic Environments. NIPS 2016: 3972-3980 - [i5]Po-An Chen, Yi-Le Chen, Chi-Jen Lu:
How Much of a Person Influencing the Others and Being Influenced Matters in Opinion Formation Games. CoRR abs/1602.02527 (2016) - [i4]Po-An Chen, Chi-Jen Lu:
Generalized Mirror Descents in Congestion Games. CoRR abs/1605.07774 (2016) - 2015
- [c38]Yi-Te Hong, Chi-Jen Lu:
Online Learning in Markov Decision Processes with Continuous Actions. ALT 2015: 302-316 - [c37]Po-An Chen, Chi-Jen Lu:
Playing Congestion Games with Bandit Feedbacks. AAMAS 2015: 1721-1722 - [i3]Chun-Liang Li, Hsuan-Tien Lin, Chi-Jen Lu:
Rivalry of Two Families of Algorithms for Memory-Restricted Streaming PCA. CoRR abs/1506.01490 (2015) - 2014
- [j22]Mu-En Wu, Shih-Ying Chang, Chi-Jen Lu, Hung-Min Sun:
A communication-efficient private matching scheme in Client-Server model. Inf. Sci. 275: 348-359 (2014) - [c36]Ku-Chun Chou, Hsuan-Tien Lin, Chao-Kai Chiang, Chi-Jen Lu:
Pseudo-reward Algorithms for Contextual Bandits with Linear Payoff Functions. ACML 2014 - [c35]Po-An Chen, Chi-Jen Lu:
Generalized mirror descents in congestion games with splittable flows. AAMAS 2014: 1233-1240 - [c34]Shang-Tse Chen, Hsuan-Tien Lin, Chi-Jen Lu:
Boosting with Online Binary Learners for the Multiclass Bandit Problem. ICML 2014: 342-350 - 2013
- [c33]Chao-Kai Chiang, Chia-Jung Lee, Chi-Jen Lu:
Beating Bandits in Gradually Evolving Worlds. COLT 2013: 210-227 - 2012
- [c32]Chi-Jen Lu:
Hitting Set Generators for Sparse Polynomials over Any Finite Fields. CCC 2012: 280-286 - [c31]Jen-Hou Chou, Chi-Jen Lu, Mu-En Wu:
Making Profit in a Prediction Market. COCOON 2012: 556-567 - [c30]Shang-Tse Chen, Hsuan-Tien Lin, Chi-Jen Lu:
An Online Boosting Algorithm with Theoretical Justifications. ICML 2012 - [c29]Chao-Kai Chiang, Tianbao Yang, Chia-Jung Lee, Mehrdad Mahdavi, Chi-Jen Lu, Rong Jin, Shenghuo Zhu:
Online Optimization with Gradual Variations. COLT 2012: 6.1-6.20 - 2011
- [j21]Chi-Jen Lu, Shi-Chun Tsai, Hsin-Lung Wu:
Complexity of Hard-Core Set Proofs. Comput. Complex. 20(1): 145-171 (2011) - [j20]Chia-Jung Lee, Chi-Jen Lu, Shi-Chun Tsai:
Extracting Computational Entropy and Learning Noisy Linear Functions. IEEE Trans. Inf. Theory 57(8): 5485-5496 (2011) - [c28]Chi-Jen Lu, Wei-Fu Lu:
Making Online Decisions with Bounded Memory. ALT 2011: 249-261 - [c27]Chia-Jung Lee, Chi-Jen Lu, Shi-Chun Tsai:
Computational Randomness from Generalized Hardcore Sets. FCT 2011: 78-89 - 2010
- [j19]Chi-Jen Lu, Hsin-Lung Wu:
On the Hardness against Constant-Depth Linear-Size Circuits. Discret. Math. Algorithms Appl. 2(4): 515-526 (2010) - [j18]Fu Chang, Chien-Yang Guo, Xiao-Rong Lin, Chi-Jen Lu:
Tree Decomposition for Large-Scale SVM Problems. J. Mach. Learn. Res. 11: 2935-2972 (2010) - [j17]Chia-Jung Lee, Chi-Jen Lu, Shi-Chun Tsai:
Deterministic Extractors for Independent-Symbol Sources. IEEE Trans. Inf. Theory 56(12): 6501-6512 (2010) - [c26]Kai-Min Chung, Feng-Hao Liu, Chi-Jen Lu, Bo-Yin Yang:
Efficient String-Commitment from Weak Bit-Commitment. ASIACRYPT 2010: 268-282 - [c25]Jen-Hou Chou, Chi-Jen Lu:
Communication Requirements for Stable Marriages. CIAC 2010: 371-382 - [c24]Chi-Jen Lu, Hsin-Lung Wu:
On the Hardness against Constant-Depth Linear-Size Circuits. COCOON 2010: 13-22 - [c23]Chao-Kai Chiang, Chi-Jen Lu:
Online Learning with Queries. SODA 2010: 616-629
2000 – 2009
- 2009
- [j16]Chi-Yuan Chan, Shan-Chyun Ku, Chi-Jen Lu, Biing-Feng Wang:
Efficient algorithms for two generalized 2-median problems and the group median problem on trees. Theor. Comput. Sci. 410(8-10): 867-876 (2009) - [c22]Chia-Jung Lee, Chi-Jen Lu, Shi-Chun Tsai:
Extracting Computational Entropy and Learning Noisy Linear Functions. COCOON 2009: 338-347 - [c21]Chi-Jen Lu:
On the Security Loss in Cryptographic Reductions. EUROCRYPT 2009: 72-87 - 2008
- [j15]Chi-Jen Lu, Shi-Chun Tsai, Hsin-Lung Wu:
On the Complexity of Hardness Amplification. IEEE Trans. Inf. Theory 54(10): 4575-4586 (2008) - [c20]Feng-Hao Liu, Chi-Jen Lu, Bo-Yin Yang:
Secure PRNGs from Specialized Polynomial Maps over Any . PQCrypto 2008: 181-202 - 2007
- [j14]Chi-Jen Lu, Shi-Chun Tsai, Hsin-Lung Wu:
Improved hardness amplification in NP. Theor. Comput. Sci. 370(1-3): 293-298 (2007) - [c19]Chun-Yuan Hsiao, Chi-Jen Lu, Leonid Reyzin:
Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility. EUROCRYPT 2007: 169-186 - [c18]Chi-Jen Lu, Shi-Chun Tsai, Hsin-Lung Wu:
Impossibility Results on Weakly Black-Box Hardness Amplification. FCT 2007: 400-411 - [c17]Chi-Jen Lu, Shi-Chun Tsai, Hsin-Lung Wu:
On the Complexity of Hard-Core Set Constructions. ICALP 2007: 183-194 - [i2]Feng-Hao Liu, Chi-Jen Lu, Bo-Yin Yang, Jintai Ding:
Secure PRNGs from Specialized Polynomial Maps over Any Fq. IACR Cryptol. ePrint Arch. 2007: 405 (2007) - 2006
- [j13]Fu Chang, Chin-Chin Lin, Chi-Jen Lu:
Adaptive Prototype Learning Algorithms: Theoretical and Experimental Studies. J. Mach. Learn. Res. 7: 2125-2148 (2006) - [j12]Yan-Cheng Chang, Chun-Yuan Hsiao, Chi-Jen Lu:
The Impossibility of Basing One-Way Permutations on Central Cryptographic Primitives. J. Cryptol. 19(1): 97-114 (2006) - [c16]Chia-Jung Lee, Chi-Jen Lu, Shi-Chun Tsai:
Deterministic Extractors for Independent-Symbol Sources. ICALP (1) 2006: 84-95 - [c15]Chi-Jen Lu:
On the Complexity of Parallel Hardness Amplification for One-Way Functions. TCC 2006: 462-481 - 2005
- [j11]Yan-Cheng Chang, Chi-Jen Lu:
Oblivious polynomial evaluation and oblivious neural learning. Theor. Comput. Sci. 341(1-3): 39-54 (2005) - [j10]Chia-Jung Lee, Chi-Jen Lu, Shi-Chun Tsai, Wen-Guey Tzeng:
Extracting randomness from multiple independent sources. IEEE Trans. Inf. Theory 51(6): 2224-2227 (2005) - [c14]Chi-Jen Lu, Shi-Chun Tsai, Hsin-Lung Wu:
On the Complexity of Hardness Amplification. CCC 2005: 170-182 - 2004
- [j9]Fu Chang, Chun-Jen Chen, Chi-Jen Lu:
A linear-time component-labeling algorithm using contour tracing technique. Comput. Vis. Image Underst. 93(2): 206-220 (2004) - [j8]Chi-Jen Lu:
Encryption against Storage-Bounded Adversaries from On-Line Strong Extractors. J. Cryptol. 17(1): 27-42 (2004) - [j7]Chi-Jen Lu:
Deterministic Hypergraph Coloring and Its Applications. SIAM J. Discret. Math. 18(2): 320-331 (2004) - 2003
- [c13]Chi-Jen Lu, Omer Reingold, Salil P. Vadhan, Avi Wigderson:
Extractors: optimal up to constant factors. STOC 2003: 602-611 - 2002
- [j6]Chi-Jen Lu:
Improved Pseudorandom Generators for Combinatorial Rectangles. Comb. 22(3): 417-434 (2002) - [c12]Yan-Cheng Chang, Chun-Yun Hsiao, Chi-Jen Lu:
On the Impossibilities of Basing One-Way Permutations on Central Cryptographic Primitives. ASIACRYPT 2002: 110-124 - [c11]Chi-Jen Lu:
Hyper-encryption against Space-Bounded Adversaries from On-Line Strong Extractors. CRYPTO 2002: 257-271 - 2001
- [j5]Chi-Jen Lu:
Derandomizing Arthur-Merlin games under uniform assumptions. Comput. Complex. 10(3): 247-259 (2001) - [j4]Frank Thomson Leighton, Chi-Jen Lu, Satish Rao, Aravind Srinivasan:
New Algorithmic Aspects of the Local Lemma with Applications to Routing and Partitioning. SIAM J. Comput. 31(2): 626-641 (2001) - [j3]Chi-Jen Lu, Shi-Chun Tsai:
A Note on Iterating an alpha-ary Gray Code. SIAM J. Discret. Math. 14(2): 237-239 (2001) - [j2]Chi-Jen Lu:
An exact characterization of symmetric functions in qAC0[2]. Theor. Comput. Sci. 261(2): 297-303 (2001) - [c10]Yan-Cheng Chang, Chi-Jen Lu:
Oblivious Polynomial Evaluation and Oblivious Neural Learning. ASIACRYPT 2001: 369-384 - [c9]Shan-Chyun Ku, Chi-Jen Lu, Biing-Feng Wang, Tzu-Chin Lin:
Efficient Algorithms for Two Generalized 2-Median Problems on Trees. ISAAC 2001: 768-778 - 2000
- [c8]Chi-Jen Lu:
Derandomizing Arthur-Merlin Games under Uniform Assumptions. ISAAC 2000: 302-312
1990 – 1999
- 1999
- [c7]David A. Mix Barrington, Chi-Jen Lu, Peter Bro Miltersen, Sven Skyum:
On Monotone Planar Circuits. CCC 1999: 24- - [c6]Chi-Jen Lu:
A Deterministic Approximation Algorithm for a Minmax Integer Programming Problem. SODA 1999: 663-668 - 1998
- [c5]Chi-Jen Lu:
An Exact Characterization of Symmetric Functions in qAC0[2]. COCOON 1998: 167-173 - [c4]Chi-Jen Lu:
Improved Pseudorandom Generators for Combinatorial Rectangles. ICALP 1998: 223-234 - [c3]Chi-Jen Lu:
Deterministic Hypergraph Coloring and Its Applications. RANDOM 1998: 35-46 - [c2]David A. Mix Barrington, Chi-Jen Lu, Peter Bro Miltersen, Sven Skyum:
Searching Constant Width Mazes Captures the AC0 Hierarchy. STACS 1998: 73-83 - 1997
- [i1]David A. Mix Barrington, Chi-Jen Lu, Peter Bro Miltersen, Sven Skyum:
Searching constant width mazes captures the AC0 hierarchy. Electron. Colloquium Comput. Complex. TR97 (1997) - 1992
- [j1]Gen-Huey Chen, Biing-Feng Wang, Chi-Jen Lu:
On the Parallel Computation of the Algebraic Path Problem. IEEE Trans. Parallel Distributed Syst. 3(2): 251-256 (1992) - 1990
- [c1]Biing-Feng Wang, Chi-Jen Lu, Gen-Huey Chen:
Constant Time Algorithms for the Transitive Closure Problem and Its Applications. ICPP (3) 1990: 52-59
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-09-22 00:37 CEST 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:
