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.

Darshan Thaker

dblp:99/1272 · DBLP profile ↗
← Back
6ranked-venue papers
3as first author
4since 2021 · last 2025
—ORCID · none

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

Artificial intelligence and machine learning · 4 · 2 first-author · 4 since 2021Systems, architecture and hardware · 2 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 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.

Artificial intelligence
4 papers
Language models and text generation · 39% Trustworthy machine learning · 35% Generative modeling · 18%
Computer graphics and multimedia
1 paper
Image and video processing · 100%
Network and information security
1 paper
Security and privacy of machine learning · 100%
Theoretical computer science
1 paper
Mathematical optimization · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning
hallucination
0.912025
SECA: Semantically Equivalent and Coherent Attacks for Eliciting LLM Hallucinations · NeurIPS 2025
Image and video processing › image restoration › deep image restoration
diffusion-based image restoration
0.912025
Frequency-Guided Posterior Sampling for Diffusion-Based Image Restoration · ICCV 2025
Image and video processing
image restoration
0.912025
Frequency-Guided Posterior Sampling for Diffusion-Based Image Restoration · ICCV 2025
Security and privacy of machine learning
adversarial attack
0.912025
SECA: Semantically Equivalent and Coherent Attacks for Eliciting LLM Hallucinations · NeurIPS 2025
Natural language and speech › Language models and text generation
alignment
0.812024
PaCE: Parsimonious Concept Engineering for Large Language Models · NeurIPS 2024
Machine learning › Generative modeling
concept erasure
0.812024
PaCE: Parsimonious Concept Engineering for Large Language Models · NeurIPS 2024
Natural language and speech › Language models and text generation
hallucination mitigation
0.812024
PaCE: Parsimonious Concept Engineering for Large Language Models · NeurIPS 2024
Natural language and speech › Language models and text generation › knowledge editing
representation editing
0.812024
PaCE: Parsimonious Concept Engineering for Large Language Models · NeurIPS 2024
Machine learning › Trustworthy machine learning › robustness
adversarial attack
0.612022
Reverse Engineering ℓp attacks: A block-sparse optimization approach with recovery guarantees · ICML 2022
Machine learning › Trustworthy machine learning
robustness
0.612022
Reverse Engineering ℓp attacks: A block-sparse optimization approach with recovery guarantees · ICML 2022
Mathematical optimization › sparse optimization
block-sparse optimization
0.612022
Reverse Engineering ℓp attacks: A block-sparse optimization approach with recovery guarantees · ICML 2022
Machine learning › Generative modeling
diffusion model
0.312025
Frequency-Guided Posterior Sampling for Diffusion-Based Image Restoration · ICCV 2025
Machine learning › Probabilistic and Bayesian machine learning › sampling
posterior sampling
0.312025
Frequency-Guided Posterior Sampling for Diffusion-Based Image Restoration · ICCV 2025
Machine learning › Representation and self-supervised learning › representation learning › unsupervised representation learning
sparse coding
0.212024
PaCE: Parsimonious Concept Engineering for Large Language Models · NeurIPS 2024

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

zeroth-order method · 1.7frequency-domain filtering · 1.7constrained optimization · 1.7bayesian inverse problem · 1.7adaptive curriculum · 1.7recovery guarantees · 1.1block-sparse optimization · 1.1sparse coding · 0.8concept dictionary · 0.8activation engineering · 0.8
YearPublicationVenuePosition
2025 Frequency-Guided Posterior Sampling for Diffusion-Based Image Restoration
abstract
Image restoration aims to recover high-quality images from degraded observations. When the degradation process is known, the recovery problem can be formulated as an inverse problem, and in a Bayesian context, the goal is to sample a clean reconstruction given the degraded observation. Recently, modern pretrained diffusion models have been used for image restoration by modifying their sampling procedure to account for the degradation process. However, these methods often rely on certain approximations that can lead to significant errors and compromised sample quality. In this paper, we provide the first rigorous analysis of this approximation error for linear inverse problems under distributional assumptions on the space of natural images, demonstrating cases where previous works can fail dramatically. Motivated by our theoretical insights, we propose a simple modification to existing diffusion-based restoration methods. Our approach introduces a time-varying low-pass filter in the frequency domain of the measurements, progressively incorporating higher frequencies during the restoration process. We develop an adaptive curriculum for this frequency schedule based on the underlying data distribution. Our method significantly improves performance on challenging image restoration tasks including motion deblurring and image dehazing.
Darshan Thaker, Abhishek Goyal, René Vidal
ICCV1
2025 SECA: Semantically Equivalent and Coherent Attacks for Eliciting LLM Hallucinations
abstract
Large Language Models (LLMs) are increasingly deployed in high-risk domains. However, state-of-the-art LLMs often exhibit hallucinations, raising serious concerns about their reliability. Prior work has explored adversarial attacks to elicit hallucinations in LLMs, but these methods often rely on unrealistic prompts, either by inserting nonsensical tokens or by altering the original semantic intent. Consequently, such approaches provide limited insight into how hallucinations arise in real-world settings. In contrast, adversarial attacks in computer vision typically involve realistic modifications to input images. However, the problem of identifying realistic adversarial prompts for eliciting LLM hallucinations remains largely underexplored. To address this gap, we propose Semantically Equivalent and Coherent Attacks (SECA), which elicit hallucinations via realistic modifications to the prompt that preserve its meaning while maintaining semantic coherence. Our contributions are threefold: (i) we formulate finding realistic attacks for hallucination elicitation as a constrained optimization problem over the input prompt space under semantic equivalence and coherence constraints; (ii) we introduce a constraint-preserving zeroth-order method to effectively search for adversarial yet feasible prompts; and (iii) we demonstrate through experiments on open-ended multiple-choice question answering tasks that SECA achieves higher attack success rates while incurring almost no semantic equivalence or semantic coherence errors compared to existing methods. SECA highlights the sensitivity of both open-source and commercial gradient-inaccessible LLMs to realistic and plausible prompt variations. Code is available at https://github.com/Buyun-Liang/SECA.
Buyun Liang 0001, Liangzu Peng, Jinqi Luo, Darshan Thaker, Kwan Ho Ryan Chan, René Vidal
NeurIPS4
2024 PaCE: Parsimonious Concept Engineering for Large Language Models
abstract
Large Language Models (LLMs) are being used for a wide variety of tasks. While they are capable of generating human-like responses, they can also produce undesirable output including potentially harmful information, racist or sexist language, and hallucinations. Alignment methods are designed to reduce such undesirable output, via techniques such as fine-tuning, prompt engineering, and representation engineering. However, existing methods face several challenges: some require costly fine-tuning for every alignment task; some do not adequately remove undesirable concepts, failing alignment; some remove benign concepts, lowering the linguistic capabilities of LLMs. To address these issues, we propose Parsimonious Concept Engineering (PaCE), a novel activation engineering framework for alignment. First, to sufficiently model the concepts, we construct a large-scale concept dictionary in the activation space, in which each atom corresponds to a semantic concept. Given any alignment task, we instruct a concept partitioner to efficiently annotate the concepts as benign or undesirable. Then, at inference time, we decompose the LLM activations along the concept dictionary via sparse coding, to accurately represent the activations as linear combinations of benign and undesirable components. By removing the latter ones from the activations, we reorient the behavior of the LLM towards the alignment goal. We conduct experiments on tasks such as response detoxification, faithfulness enhancement, and sentiment revising, and show that PaCE achieves state-of-the-art alignment performance while maintaining linguistic capabilities.
Jinqi Luo, Tianjiao Ding, Kwan Ho Ryan Chan, Darshan Thaker, Aditya Chattopadhyay, Chris Callison-Burch, René Vidal
NeurIPS4
2022 Reverse Engineering ℓp attacks: A block-sparse optimization approach with recovery guarantees
Darshan Thaker, Paris Giampouras, René Vidal
ICML1
2006 Simulation tools to study a distributed shared memory for clusters of symmetric multiprocessors
Darshan Thaker, Vipin Chaudhary
Future Gener. Comput. Syst.1
2004 Experiments with Parallelizing Tribology Simulations
Vipin Chaudhary, William L. Hase, Hai Jiang 0003, Darshan Thaker
J. Supercomput.5