Image de couverture de livre

Time Can Invalidate Algorithmic Recourse

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	De Toni, Giovanni, Teso, Stefano, Lepri, Bruno, Passerini, Andrea
Format:	Preprint
Publié:	2024
Sujets:	Machine Learning Computers and Society
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Personalized Algorithmic Recourse with Preference Elicitation
par: De Toni, Giovanni, et autres
Publié: (2022)

Exploiting Preference Elicitation in Interactive and User-centered Algorithmic Recourse: An Initial Exploration
par: Esfahani, Seyedehdelaram, et autres
Publié: (2024)

Revisiting (Un)Fairness in Recourse by Minimizing Worst-Case Social Burden
par: Barrainkua, Ainhize, et autres
Publié: (2025)

GNN Explanations that do not Explain and How to find Them
par: Azzolin, Steve, et autres
Publié: (2026)

To Ask or Not to Ask: Learning to Require Human Feedback
par: Pugnana, Andrea, et autres
Publié: (2025)

Time Series Foundation Models are Flow Predictors
par: Luca, Massimiliano, et autres
Publié: (2025)

Fairness in Algorithmic Recourse Through the Lens of Substantive Equality of Opportunity
par: Bell, Andrew, et autres
Publié: (2024)

Performative Validity of Recourse Explanations
par: König, Gunnar, et autres
Publié: (2025)

The Risks of Recourse in Binary Classification
par: Fokkema, Hidde, et autres
Publié: (2023)

Prediction without Preclusion: Recourse Verification with Reachable Sets
par: Kothari, Avni, et autres
Publié: (2023)

Beyond Topological Self-Explainable GNNs: A Formal Explainability Perspective
par: Azzolin, Steve, et autres
Publié: (2025)

A New Paradigm for Counterfactual Reasoning in Fairness and Recourse
par: Bynum, Lucius E. J., et autres
Publié: (2024)

Learning Recourse Costs from Pairwise Feature Comparisons
par: Rawal, Kaivalya, et autres
Publié: (2024)

Reconsidering Faithfulness in Regular, Self-Explainable and Domain Invariant GNNs
par: Azzolin, Steve, et autres
Publié: (2024)

Hyperdimensional Probe: Decoding LLM Representations via Vector Symbolic Architectures
par: Bronzini, Marco, et autres
Publié: (2025)

KTCF: Actionable Recourse in Knowledge Tracing via Counterfactual Explanations for Education
par: Kim, Woojin, et autres
Publié: (2026)

Unveiling LLMs: The Evolution of Latent Representations in a Dynamic Knowledge Graph
par: Bronzini, Marco, et autres
Publié: (2024)

Glitter or Gold? Deriving Structured Insights from Sustainability Reports via Large Language Models
par: Bronzini, Marco, et autres
Publié: (2023)

Towards Human-AI Complementarity with Prediction Sets
par: De Toni, Giovanni, et autres
Publié: (2024)

Concise and Logically Consistent Conformal Sets for Neuro-Symbolic Concept-Based Models
par: Bortolotti, Samuele, et autres
Publié: (2026)

Spurious Correlations in Concept Drift: Can Explanatory Interaction Help?
par: Lalletti, Cristiana, et autres
Publié: (2024)

Shortcuts and Identifiability in Concept-based Models from a Neuro-Symbolic Lens
par: Bortolotti, Samuele, et autres
Publié: (2025)

GNNs Meet Sequence Models Along the Shortest-Path: an Expressive Method for Link Prediction
par: Ferrini, Francesco, et autres
Publié: (2025)

If Concept Bottlenecks are the Question, are Foundation Models the Answer?
par: Debole, Nicola, et autres
Publié: (2025)

Generative AI collective behavior needs an interactionist paradigm
par: Ferrarotti, Laura, et autres
Publié: (2026)

Divide et Calibra: Multiclass Local Calibration via Vector Quantization
par: Barbera, Cesare, et autres
Publié: (2026)

Multiclass Local Calibration with the Jensen-Shannon Distance
par: Barbera, Cesare, et autres
Publié: (2025)

Fuck the Algorithm: Conceptual Issues in Algorithmic Bias
par: Stinson, Catherine
Publié: (2025)

When Can Memorization Improve Fairness?
par: Pepin, Bob, et autres
Publié: (2024)

Boosting Relational Deep Learning with Pretrained Tabular Models
par: Lachi, Veronica, et autres
Publié: (2025)

Algorithmic Recourse in Abnormal Multivariate Time Series
par: Han, Xiao, et autres
Publié: (2023)

Towards Logically Consistent Language Models via Probabilistic Reasoning
par: Calanzone, Diego, et autres
Publié: (2024)

The Importance of Time in Causal Algorithmic Recourse
par: Beretta, Isacco, et autres
Publié: (2023)

The ProLiFIC dataset: Leveraging LLMs to Unveil the Italian Lawmaking Process
par: Contestabile, Matilde, et autres
Publié: (2025)

BEARS Make Neuro-Symbolic Models Aware of their Reasoning Shortcuts
par: Marconato, Emanuele, et autres
Publié: (2024)

Can Probabilistic Feedback Drive User Impacts in Online Platforms?
par: Dai, Jessica, et autres
Publié: (2024)

RTP-LX: Can LLMs Evaluate Toxicity in Multilingual Scenarios?
par: de Wynter, Adrian, et autres
Publié: (2024)

The Role of Learning Algorithms in Collective Action
par: Ben-Dov, Omri, et autres
Publié: (2024)

Unprocessing Seven Years of Algorithmic Fairness
par: Cruz, André F., et autres
Publié: (2023)

With a Little Help From My Friends: Collective Manipulation in Risk-Controlling Recommender Systems
par: De Toni, Giovanni, et autres
Publié: (2026)