Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Yu-Chia Chen

dblp:143/7705 · DBLP profile ↗
← Back
7ranked-venue papers
4as first author
3since 2021 · last 2026
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 4 · 3 first-author · 2 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 1 first-authorSystems, architecture and hardware · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
2 papers
Computational geometry · 44% Graph algorithms and graph theory · 41% Algorithms and data structures · 15%
Artificial intelligence
2 papers
Representation and self-supervised learning · 70% Graph learning · 30%
Databases, data mining, and information retrieval
1 paper
Data models and query languages · 50% Data mining · 50%

Topics — the 13 heaviest of 15, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Representation and self-supervised learning › representation learning
dimensionality reduction
0.612022
Manifold Coordinates with Physical Meaning · J. Mach. Learn. Res. 2022
Machine learning › Representation and self-supervised learning › representation learning › dimensionality reduction › manifold learning
manifold embedding
0.612022
Manifold Coordinates with Physical Meaning · J. Mach. Learn. Res. 2022
Machine learning › Representation and self-supervised learning › representation learning › dimensionality reduction
manifold learning
0.612022
Manifold Coordinates with Physical Meaning · J. Mach. Learn. Res. 2022
Computational geometry › topological data analysis
persistent homology
0.512021
The decomposition of the higher-order homology embedding constructed from the $k$-Laplacian · NeurIPS 2021
Graph algorithms and graph theory
spectral graph theory
0.512021
The decomposition of the higher-order homology embedding constructed from the $k$-Laplacian · NeurIPS 2021
Computational geometry
topological data analysis
0.512021
The decomposition of the higher-order homology embedding constructed from the $k$-Laplacian · NeurIPS 2021
Machine learning › Graph learning › dynamic graph learning
dynamic network embedding
0.412019
On Dynamic Network Models and Application to Causal Impact · KDD 2019
Machine learning › Graph learning
graph representation learning
0.412019
On Dynamic Network Models and Application to Causal Impact · KDD 2019
Data mining › structured data mining › graph mining › community detection › stochastic block model
dynamic stochastic block model
0.412019
On Dynamic Network Models and Application to Causal Impact · KDD 2019
Data models and query languages › data modeling
network data model
0.412019
On Dynamic Network Models and Application to Causal Impact · KDD 2019
Algorithms and data structures › numerical linear algebra › dimensionality reduction › nonlinear dimensionality reduction
manifold learning
0.412019
Selecting the independent coordinates of manifolds with large aspect ratios · NeurIPS 2019
Graph algorithms and graph theory › spectral graph theory
spectral embedding
0.412019
Selecting the independent coordinates of manifolds with large aspect ratios · NeurIPS 2019
Graph algorithms and graph theory › graph clustering
spectral clustering
0.112021
The decomposition of the higher-order homology embedding constructed from the $k$-Laplacian · NeurIPS 2021

Methods — techniques the papers use, named apart from their topics

regularized optimization · 0.8conditional pseudo-likelihood · 0.8sparse recovery · 0.6group lasso · 0.6spectral loop detection · 0.5k-laplacian · 0.5homology factorization · 0.5eigencoordinate selection · 0.4bicriterial selection · 0.4
YearPublicationVenuePosition
2026 A PVT-Resilient Subthreshold SRAM-Based In-Memory Computing Accelerator With In-Situ Regulation for Energy-Efficient Spiking Neural Networks
abstract
This paper presents a PVT-resilient, subthreshold SRAM-based computing-in-memory (CIM) macro tailored for energy-efficient spiking neural networks (SNNs). The macro integrates in-situ current sensors and distributed voltage regulators to enable robust large-scale (1024 wordlines, 1304 bitlines and 128 shared neuron cells) subthreshold current-mode CIM, mitigating energy overheads and process-voltage-temperature (PVT) sensitivity. The neuron cells adopt a programmable, memory cell-based firing threshold to enhance neuron robustness against PVT variations. The architecture uses a stride-tick batching schedule to significantly reduce buffer overhead with enhanced input data reuse. Exploiting the high sparsity of SNNs, the proposed system demonstrates significant improvements in energy efficiency and variation tolerance. Fabricated in 28-nm CMOS, the prototype attains 93.64\% accuracy on keyword spotting, delivers up to 1181.42 TOPS/W, and achieves 7.24 TOPS/mm^2, demonstrating a viable and efficient solution for high-performance edge SNN processing.
Shih-Hang Kao, Yang-Chan Hung, I-Wen Wang, Bing-Han Liu, Yu-Chia Chen, Tian-Sheuan Chang, Shyh-Jye Jou, Chien-Nan Jimmy Liu, Hung-Ming Chen, Wei-Zen Chen
IEEE Trans. Circuits Syst. I Regul. Pap.5
2022 Manifold Coordinates with Physical Meaning
abstract
Manifold embedding algorithms map high-dimensional data down to coordinates in a much lower-dimensional space. One of the aims of dimension reduction is to find intrinsic coordinates that describe the data manifold. The coordinates returned by the embedding algorithm are abstract, and finding their physical or domain-related meaning is not formalized and often left to domain experts. This paper studies the problem of recovering the meaning of the new low-dimensional representation in an automatic, principled fashion. We propose a method to explain embedding coordinates of a manifold as non-linear compositions of functions from a user-defined dictionary. We show that this problem can be set up as a sparse linear Group Lasso recovery problem, find sufficient recovery conditions, and demonstrate its effectiveness on data.
Samson J. Koelle, Marina Meila, Yu-Chia Chen
J. Mach. Learn. Res.4
2021 The decomposition of the higher-order homology embedding constructed from the $k$-Laplacian
abstract
The null space of the $k$-th order Laplacian $\mathbf{\mathcal L}_k$, known as the {\em $k$-th homology vector space}, encodes the non-trivial topology of a manifold or a network. Understanding the structure of the homology embedding can thus disclose geometric or topological information from the data. The study of the null space embedding of the graph Laplacian $\mathbf{\mathcal L}_0$ has spurred new research and applications, such as spectral clustering algorithms with theoretical guarantees and estimators of the Stochastic Block Model. In this work, we investigate the geometry of the $k$-th homology embedding and focus on cases reminiscent of spectral clustering. Namely, we analyze the {\em connected sum} of manifolds as a perturbation to the direct sum of their homology embeddings. We propose an algorithm to factorize the homology embedding into subspaces corresponding to a manifold's simplest topological components. The proposed framework is applied to the {\em shortest homologous loop detection} problem, a problem known to be NP-hard in general. Our spectral loop detection algorithm scales better than existing methods and is effective on diverse data such as point clouds and images.
Yu-Chia Chen, Marina Meila
NeurIPS1
2019 On Dynamic Network Models and Application to Causal Impact
abstract
Dynamic extensions of Stochastic block model (SBM) are of importance in several fields that generate temporal interaction data. These models, besides producing compact and interpretable network representations, can be useful in applications such as link prediction or network forecasting. In this paper we present a conditional pseudo-likelihood based extension to dynamic SBM that can be efficiently estimated by optimizing a regularized objective. Our formulation leads to a highly scalable approach that can handle very large networks, even with millions of nodes. We also extend our formalism to causal impact for networks that allows us to quantify the impact of external events on a time dependent sequence of networks. We support our work with extensive results on both synthetic and real networks.
Yu-Chia Chen, Avleen Singh Bijral, Juan M. Lavista Ferres
KDD1
2019 Selecting the independent coordinates of manifolds with large aspect ratios
abstract
Many manifold embedding algorithms fail apparently when the data manifold has a large aspect ratio (such as a long, thin strip). Here, we formulate success and failure in terms of finding a smooth embedding, showing also that the problem is pervasive and more complex than previously recognized. Mathematically, success is possible under very broad conditions, provided that embedding is done by carefully selected eigenfunctions of the Laplace-Beltrami operator $\Delta_\M$. Hence, we propose a bicriterial Independent Eigencoordinate Selection (IES) algorithm that selects smooth embeddings with few eigenvectors. The algorithm is grounded in theory, has low computational overhead, and is successful on synthetic and large real data.
Yu-Chia Chen, Marina Meila
NeurIPS1
2018 The Role of mRNA Transporter in Human Cancer
abstract
Abnormal mRNA export causes many human diseases, including genetic diseases and tumorigenesis. However, the underlying mechanism was not well understood. In this study, we explored the roles of nuclear export factor2 (NXF2) in the development of hepatocellular carcinoma (HCC). We analyzed the expression level of NXF2 in HCC tissue and found down-regulation of NXF2 in HCC. Then we overexpressed NXF2 in HCC cell Huh-7 and found overexpression of NXF2 causes the down-regulation of migration and invasion in Huh-7 cells. Our results demonstrated loss-of-function of NXF2 in HCC clinical samples and the role of NXF2 in HCC tumorigenesis. Finally, we used Ingenuity Pathway Analysis (IPA) to evaluate the molecular interactions and pathway which were regulated by NXF2.
Yu-Chia Chen, Chien-Chih Chiu, Han-Lin Chou, Jan-Gowth Chang
BIBE1
2018 The Amiloride Derivatives Regulate the Alternative Splicing of Apoptotic Gene Transcripts
abstract
Alternative splicing of precursor mRNA is an important mechanism for increasing the complexity of gene expression, and it plays a key role in cell differentiation and organism development. Accurate alternative splicing profiles and regulation will affect the cellular functions and destiny. Our previous studies showed that amiloride have a potential effect on alternative splicing, but the high effective concentration of amiloride limits its clinical application. In this study, the molecular docking calculation was performed to estimate the binding affinity between a series synthesized amiloride derivatives and SRPK1 protein in silico and then detect its activity in alternative splicing in vitro. The results showed that amiloride derivatives DS010, DS150, and ES013 have better binding affinity and could regulate the alternative splicing of BCL-X transcripts to increase the proportion of BCL-XL in Huh-7 cells. In addition, the effective concentration of DS010 and ES013 are lower than others. These findings suggested that the amiloride derivative DS010 and ES013 may provide therapeutic potential for future cancer treatment.
Chien-Chih Lee, Wen-Hsin Chang, Ting-Yuan Liu, Yu-Chia Chen, Yang-Chang Wu, Jan-Gowth Chang
BIBE4