Chien-Yi Wang

Chien-Yi Wang

Auto-generated profile, based on publicly available information

Chien-Yi Wang

LTCI, Telecom ParisTech, Paris, France

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
31 August 2016 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
CWChien-Yi Wang
Chien-Yi Wang
Sung Hoon LimSung Hoon Lim
Sung Hoon Lim
MGMichael Gastpar
Michael Gastpar
Under the paradigm of caching, partial data are delivered before the actual requests of users are known. In this paper, this problem is modeled as a canonical distributed source coding problem with side information, where the side information represents the users' requests. For the single-user case, a singleletter characterization of the optimal rate region is established, and for several important special cases, closed-form solutions are given, including the scenario of uniformly distributed user requests. In this case, it is shown that the optimal caching strategy is closely related to total correlation and Wyner's common information. Using the insight gained from the single-user case, three two-user scenarios admitting single-letter characterization are considered, which draw connections to existing source coding problems in the literature: the Gray-Wyner system and distributed successive refinement. Finally, the model studied by Maddah-Ali and Niesen is rephrased to make a comparison with the considered information-theoretic model. Although the two caching models have a similar behavior for the single-user case, it is shown through a two-user example that the two caching models behave differently in general.

18 July 2018 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
CWChien-Yi Wang
Chien-Yi Wang
SBShirin Saeedi Bidokhti
Shirin Saeedi Bidokhti
MWMichèle Angela Wigger
Michèle Angela Wigger
Improved lower bounds are derived on the average and worst case rate-memory tradeoffs of the Maddah-Ali and Niesen-coded caching scenario. For any number of users and files and for arbitrary cache sizes, the multiplicative gap between the exact rate-memory tradeoff and the new lower bound is shown to be less than 2.315 in the worst case scenario and 2.507 in the average-case scenario.

15 May 2018 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
CWChien-Yi Wang
Chien-Yi Wang
MWMichèle Angela Wigger
Michèle Angela Wigger
AZAbdellatif Zaidi
Abdellatif Zaidi
This work investigates the downlink of a cloud radio access network (C-RAN) in which a central processor communicates with two mobile users through two base stations (BSs). The BSs act as relay nodes and cooperate with each other through error-free rate-limited links. We develop and analyze two coding schemes for this scenario. The first coding scheme modifies the Liu-Kang scheme (to make it amenable to a rigorous analysis) and extends it to introduce common codewords and to apply for downlink C-RAN with BS-to-BS cooperation. This first coding scheme enables arbitrary correlation among the auxiliary codewords that are recovered by the BSs. We show that this scheme improves over previous schemes for various instances of Gaussian C-RAN channels. In particular, in many scearios, the scheme can better exploit the possibility of BS-to-BS cooperation than other schemes. The second coding scheme extends the distributed decode and forward (DDF) scheme by means of Gray-Wyner compression and by exploiting the cooperation links between BSs. In addition and as a separate extension, we provide an improved capacity approximation for the DDF strategy for the capacity of a general N-BS L-user C-RAN model in the memoryless Gaussian case.

28 November 2022 in arXiv
Verified
Preprint
Open access
PDF file
FWFu-En Wang
Fu-En Wang
CWChien-Yi Wang
Chien-Yi Wang
MSMin Sun
Min Sun
SLShang-Hong Lai
Shang-Hong Lai
Although significant progress has been made in face recognition, demographic bias still exists in face recognition systems. For instance, it usually happens that the face recognition performance for a certain demographic group is lower than the others. In this paper, we propose MixFairFace framework to improve the fairness in face recognition models. First of all, we argue that the commonly used attribute-based fairness metric is not appropriate for face recognition. A face recognition system can only be considered fair while every person has a close performance. Hence, we propose a new evaluation protocol to fairly evaluate the fairness performance of different approaches. Different from previous approaches that require sensitive attribute labels such as race and gender for reducing the demographic bias, we aim at addressing the identity bias in face representation, i.e., the performance inconsistency between different identities, without the need for sensitive attribute labels. To this end, we propose MixFair Adapter to determine and reduce the identity bias of training samples. Our extensive experiments demonstrate that our MixFairFace approach achieves state-of-the-art fairness performance on all benchmark datasets.