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

Irene Mengze Li

dblp:268/0894 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
1since 2021 · last 2021
—ORCID · none

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

Artificial intelligence and machine learning · 2 · 1 since 2021

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
1 paper
Algorithms and data structures · 67% Distributed computing theory · 17% Approximation and online algorithms · 17%
Artificial intelligence
1 paper
Trustworthy machine learning · 77% Language models and text generation · 23%

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

TopicWeightPapersLastEvidence papers
Approximation and online algorithms
approximation algorithms
0.512021
Streaming and Distributed Algorithms for Robust Column Subset Selection · ICML 2021
Algorithms and data structures › matrix approximation
column subset selection
0.512021
Streaming and Distributed Algorithms for Robust Column Subset Selection · ICML 2021
Algorithms and data structures › data summarization
coresets
0.512021
Streaming and Distributed Algorithms for Robust Column Subset Selection · ICML 2021
Distributed computing theory
distributed algorithms
0.512021
Streaming and Distributed Algorithms for Robust Column Subset Selection · ICML 2021
Algorithms and data structures
matrix approximation
0.512021
Streaming and Distributed Algorithms for Robust Column Subset Selection · ICML 2021
Algorithms and data structures › data streams
streaming algorithms
0.512021
Streaming and Distributed Algorithms for Robust Column Subset Selection · ICML 2021
Machine learning › Trustworthy machine learning
fairness
0.412020
Towards Debiasing Sentence Representations · ACL 2020
Natural language and speech › Language models and text generation › text representation
contextualized word embeddings
0.112020
Towards Debiasing Sentence Representations · ACL 2020

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

greedy algorithm · 0.5entrywise ℓ_p norm · 0.5
YearPublicationVenuePosition
2021 Streaming and Distributed Algorithms for Robust Column Subset Selection
abstract
We give the first single-pass streaming algorithm for Column Subset Selection with respect to the entrywise $\ell_p$-norm with $1 \leq p < 2$. We study the $\ell_p$ norm loss since it is often considered more robust to noise than the standard Frobenius norm. Given an input matrix $A \in \mathbb{R}^{d \times n}$ ($n \gg d$), our algorithm achieves a multiplicative $k^{\frac{1}{p} - \frac{1}{2}}\poly(\log nd)$-approximation to the error with respect to the \textit{best possible column subset} of size $k$. Furthermore, the space complexity of the streaming algorithm is optimal up to a logarithmic factor. Our streaming algorithm also extends naturally to a 1-round distributed protocol with nearly optimal communication cost. A key ingredient in our algorithms is a reduction to column subset selection in the $\ell_{p,2}$-norm, which corresponds to the $p$-norm of the vector of Euclidean norms of each of the columns of $A$. This enables us to leverage strong coreset constructions for the Euclidean norm, which previously had not been applied in this context. We also give the first provable guarantees for greedy column subset selection in the $\ell_{1, 2}$ norm, which can be used as an alternative, practical subroutine in our algorithms. Finally, we show that our algorithms give significant practical advantages on real-world data analysis tasks.
Shuli Jiang, Dennis Li, Irene Mengze Li, Arvind V. Mahankali, David P. Woodruff
ICML3
2020 Towards Debiasing Sentence Representations
abstract
As natural language processing methods are increasingly deployed in real-world scenarios such as healthcare, legal systems, and social science, it becomes necessary to recognize the role they potentially play in shaping social biases and stereotypes.Previous work has revealed the presence of social biases in widely used word embeddings involving gender, race, religion, and other social constructs.While some methods were proposed to debias these word-level embeddings, there is a need to perform debiasing at the sentence-level given the recent shift towards new contextualized sentence representations such as ELMo and BERT.In this paper, we investigate the presence of social biases in sentence-level representations and propose a new method, SENT-DEBIAS, to reduce these biases.We show that SENT-DEBIAS is effective in removing biases, and at the same time, preserves performance on sentence-level downstream tasks such as sentiment analysis, linguistic acceptability, and natural language understanding.We hope that our work will inspire future research on characterizing and removing social biases from widely adopted sentence representations for fairer NLP.
Paul Pu Liang, Irene Mengze Li, Emily Zheng, Yao Chong Lim, Ruslan Salakhutdinov, Louis-Philippe Morency
ACL2