Picture for Vincent Cohen-Addad

Vincent Cohen-Addad

The Geometry of Refusal in Large Language Models: Concept Cones and Representational Independence

Add code
Feb 24, 2025
Viaarxiv icon

REINFORCE Adversarial Attacks on Large Language Models: An Adaptive, Distributional, and Semantic Objective

Add code
Feb 24, 2025
Viaarxiv icon

A Tight VC-Dimension Analysis of Clustering Coresets with Applications

Add code
Jan 11, 2025
Figure 1 for A Tight VC-Dimension Analysis of Clustering Coresets with Applications
Figure 2 for A Tight VC-Dimension Analysis of Clustering Coresets with Applications
Figure 3 for A Tight VC-Dimension Analysis of Clustering Coresets with Applications
Viaarxiv icon

Re-Invoke: Tool Invocation Rewriting for Zero-Shot Tool Retrieval

Add code
Aug 03, 2024
Figure 1 for Re-Invoke: Tool Invocation Rewriting for Zero-Shot Tool Retrieval
Figure 2 for Re-Invoke: Tool Invocation Rewriting for Zero-Shot Tool Retrieval
Figure 3 for Re-Invoke: Tool Invocation Rewriting for Zero-Shot Tool Retrieval
Figure 4 for Re-Invoke: Tool Invocation Rewriting for Zero-Shot Tool Retrieval
Viaarxiv icon

Dynamic Correlation Clustering in Sublinear Update Time

Add code
Jun 13, 2024
Viaarxiv icon

Multi-View Stochastic Block Models

Add code
Jun 07, 2024
Viaarxiv icon

Perturb-and-Project: Differentially Private Similarities and Marginals

Add code
Jun 07, 2024
Viaarxiv icon

A Near-Linear Time Approximation Algorithm for Beyond-Worst-Case Graph Clustering

Add code
Jun 07, 2024
Viaarxiv icon

Data-Efficient Learning via Clustering-Based Sensitivity Sampling: Foundation Models and Beyond

Add code
Feb 27, 2024
Figure 1 for Data-Efficient Learning via Clustering-Based Sensitivity Sampling: Foundation Models and Beyond
Figure 2 for Data-Efficient Learning via Clustering-Based Sensitivity Sampling: Foundation Models and Beyond
Figure 3 for Data-Efficient Learning via Clustering-Based Sensitivity Sampling: Foundation Models and Beyond
Figure 4 for Data-Efficient Learning via Clustering-Based Sensitivity Sampling: Foundation Models and Beyond
Viaarxiv icon

A Scalable Algorithm for Individually Fair K-means Clustering

Add code
Feb 09, 2024
Figure 1 for A Scalable Algorithm for Individually Fair K-means Clustering
Figure 2 for A Scalable Algorithm for Individually Fair K-means Clustering
Figure 3 for A Scalable Algorithm for Individually Fair K-means Clustering
Figure 4 for A Scalable Algorithm for Individually Fair K-means Clustering
Viaarxiv icon