← Search

Gjergji. Kasneci

26 accepted papers

2026

Active Tabular Augmentation via Policy-Guided Diffusion Inpainting

ICML 2026poster

Generative tabular augmentation is appealing in data-scarce domains, yet the prevailing focus on distributional fidelity does not reliably translate into better downstream models. We formalize a *fidelity-utility gap*: common generative objectives prioritize distributional plausibility, whereas augm…

Cited by 0SourceScholar
2026

Position: Sycophancy is an Educational Safety Risk: Why LLM Tutors Need Sycophancy Benchmarks

ICML 2026poster

This position paper argues that effective tutoring requires **corrective friction**: surfacing misconceptions and challenging them supportively to drive conceptual change. Yet preference-aligned LLMs can trade **epistemic rigor** for agreeableness. We identify a **Reasoning-Sycophancy Paradox**: mod…

Cited by 0SourceScholar
2025

CURE: Controlled Unlearning for Robust Embeddings — Mitigating Conceptual Shortcuts in Pre-Trained Language Models

EMNLP 2025

Pre-trained language models have achieved remarkable success across diverse applications but remain susceptible to spurious, concept-driven correlations that impair robustness and fairness. In this work, we introduce CURE, a novel and lightweight framework that systematically disentangles and suppre

Cited by 0SourcePDFScholar
2025

Doubling Your Data in Minutes: Ultra-fast Tabular Data Generation via LLM-Induced Dependency Graphs

EMNLP 2025

Tabular data is critical across diverse domains, yet high-quality datasets remain scarce due to privacy concerns and the cost of collection. Contemporary approaches adopt large language models (LLMs) for tabular augmentation, but exhibit two major limitations: (1) dense dependency modeling among tab

Cited by 0SourcePDFScholar
2025

Graph Inverse Style Transfer for Counterfactual Explainability

ICML 2025poster

Counterfactual explainability seeks to uncover model decisions by identifying minimal changes to the input that alter the predicted outcome. This task becomes particularly challenging for graph data due to preserving structural integrity and semantic meaning. Unlike prior approaches that rely on for…

Cited by 0SourcePDFScholar
2025

Grokking in the Wild: Data Augmentation for Real-World Multi-Hop Reasoning with Transformers

ICML 2025poster

Transformers have achieved great success in numerous NLP tasks but continue to exhibit notable gaps in multi-step factual reasoning, especially when real-world knowledge is sparse. Recent advances in grokking have demonstrated that neural networks can transition from memorizing to perfectly generali…

Cited by 0SourcePDFScholar
2025

Not All Features Deserve Attention: Graph-Guided Dependency Learning for Tabular Data Generation with Language Models

EMNLP 2025

Large Language Models (LLMs) have shown strong potential for tabular data generation by modeling textualized feature-value pairs. However, tabular data inherently exhibits sparse feature-level dependencies, where many feature interactions are structurally insignificant. This creates a fundamental mi

Cited by 0SourcePDFScholar
2025

Position: Uncertainty Quantification Needs Reassessment for Large Language Model Agents

ICML 2025poster

Large-language models (LLMs) and chatbot agents are known to provide wrong outputs at times, and it was recently found that this can never be fully prevented. Hence, uncertainty quantification plays a crucial role, aiming to quantify the level of ambiguity in either one overall number or two numbers…

Cited by 0SourcePDFScholar
2025

Probabilistic Aggregation and Targeted Embedding Optimization for Collective Moral Reasoning in Large Language Models

ACL 2025finding

Large Language Models (LLMs) have shown impressive moral reasoning abilities. Yet they often diverge when confronted with complex, multi-factor moral dilemmas. To address these discrepancies, we propose a framework that synthesizes multiple LLMs’ moral judgments into a collectively formulated moral…

2025

RAZOR: Sharpening Knowledge by Cutting Bias with Unsupervised Text Rewriting

AAAI 2025technical

Despite the widespread use of LLMs due to their superior performance in various tasks, their high computational costs often lead potential users to opt for the pretraining-finetuning pipeline. However, biases prevalent in manually constructed datasets can introduce spurious correlations between toke…

2025

SCISSOR: Mitigating Semantic Bias through Cluster-Aware Siamese Networks for Robust Classification

ICML 2025poster

Shortcut learning undermines model generalization to out-of-distribution data. While the literature attributes shortcuts to biases in superficial features, we show that imbalances in the semantic distribution of sample embeddings induce spurious semantic correlations, compromising model robustness.…

2024

I Prefer Not to Say: Protecting User Consent in Models with Optional Personal Data

AAAI 2024technical

We examine machine learning models in a setup where individuals have the choice to share optional personal information with a decision-making system, as seen in modern insurance pricing models. Some users consent to their data being used whereas others object and keep their data undisclosed. In this…

2024

Is Crowdsourcing Breaking Your Bank? Cost-Effective Fine-Tuning of Pre-trained Language Models with Proximal Policy Optimization

COLING 2024main

Wide usage of ChatGPT has highlighted the potential of reinforcement learning from human feedback. However, its training pipeline relies on manual ranking, a resource-intensive process. To reduce labor costs, we propose a self-supervised text ranking approach for applying Proximal-Policy-Optimizatio…

Cited by 4SourcePDFScholar
2024

P-TA: Using Proximal Policy Optimization to Enhance Tabular Data Augmentation via Large Language Models

ACL 2024findings

A multitude of industries depend on accurate and reasonable tabular data augmentation for their business processes. Contemporary methodologies in generating tabular data revolve around utilizing Generative Adversarial Networks (GAN) or fine-tuning Large Language Models (LLM). However, GAN-based appr…

2024

The Language of Trauma: Modeling Traumatic Event Descriptions Across Domains with Explainable AI

EMNLP 2024finding

Psychological trauma can manifest following various distressing events and is captured in diverse online contexts. However, studies traditionally focus on a single aspect of trauma, often neglecting the transferability of findings across different scenarios. We address this gap by training various l…

2023

Interventional SHAP Values and Interaction Values for Piecewise Linear Regression Trees

AAAI 2023technical

In recent years, game-theoretic Shapley values have gained increasing attention with respect to local model explanation by feature attributions. While the approach using Shapley values is model-independent, their (exact) computation is usually intractable, so efficient model-specific algorithms have…

2023

Language Models are Realistic Tabular Data Generators

ICLR 2023poster

Tabular data is among the oldest and most ubiquitous forms of data. However, the generation of synthetic samples with the original data’s characteristics remains a significant challenge for tabular data. While many generative models from the computer vision domain, such as variational autoencoders o…

2023

On the Trade-Off between Actionable Explanations and the Right to be Forgotten

ICLR 2023poster

As machine learning (ML) models are increasingly being deployed in high-stakes applications, policymakers have suggested tighter data protection regulations (e.g., GDPR, CCPA). One key principle is the “right to be forgotten” which gives users the right to have their data deleted. Another key princi…

Cited by 20SourcePDFScholar
2023

Probabilistically Robust Recourse: Navigating the Trade-offs between Costs and Robustness in Algorithmic Recourse

ICLR 2023poster

As machine learning models are increasingly being employed to make consequential decisions in real-world settings, it becomes critical to ensure that individuals who are adversely impacted (e.g., loan denied) by the predictions of these models are provided with a means for recourse. While several ap…

2023

When are post-hoc conceptual explanations identifiable?

UAI 2023poster

Interest in understanding and factorizing learned embedding spaces through conceptual explanations is steadily growing. When no human concept labels are available, concept discovery methods search trained embedding spaces for interpretable concepts like object shape or color that can provide post-ho…

2022

A Consistent and Efficient Evaluation Strategy for Attribution Methods

ICML 2022spotlight

With a variety of local feature attribution methods being proposed in recent years, follow-up work suggested several evaluation strategies. To assess the attribution quality across different attribution techniques, the most popular among these evaluation strategies in the image domain use pixel pert…

2021

CARLA: A Python Library to Benchmark Algorithmic Recourse and Counterfactual Explanation Algorithms

NeurIPS 2021poster

Counterfactual explanations provide means for prescriptive model explanations by suggesting actionable feature changes (e.g., increase income) that allow individuals to achieve favourable outcomes in the future (e.g., insurance approval). Choosing an appropriate method is a crucial aspect for meanin…

Cited by 101SourcecodeScholar
2020

On Counterfactual Explanations under Predictive Multiplicity

UAI 2020poster

Counterfactual explanations are usually obtainedby identifying the smallest change made to an input to change a prediction made by a fixed model (hereafter called sparse methods). Recent work, however, has revitalized an old insight: there often does not exist one superior solution to a prediction p…

Cited by 98SourcePDFScholar