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

Abdirisak Mohamed

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

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

Artificial intelligence and machine learning · 2 · 2 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.

Network and information security
1 paper
Digital forensics and information hiding · 100%
Artificial intelligence
1 paper
Efficient and distributed learning · 100%
Theoretical computer science
1 paper
Algorithmic game theory and mechanism design · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning
federated learning
0.812024
FACT or Fiction: Can Truthful Mechanisms Eliminate Federated Free Riding? · NeurIPS 2024
Digital forensics and information hiding › watermarking › robust watermarking
robust image watermarking
0.812024
WAVES: Benchmarking the Robustness of Image Watermarks · ICML 2024
Digital forensics and information hiding › watermarking
robust watermarking
0.812024
WAVES: Benchmarking the Robustness of Image Watermarks · ICML 2024
Digital forensics and information hiding
watermarking
0.812024
WAVES: Benchmarking the Robustness of Image Watermarks · ICML 2024
Algorithmic game theory and mechanism design › mechanism design
truthful mechanism
0.212024
FACT or Fiction: Can Truthful Mechanisms Eliminate Federated Free Riding? · NeurIPS 2024

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

penalty system · 1.5mechanism design · 1.5stress testing · 0.8diffusion-based attacks · 0.8adversarial attack · 0.8
YearPublicationVenuePosition
2024 WAVES: Benchmarking the Robustness of Image Watermarks
abstract
In the burgeoning age of generative AI, watermarks act as identifiers of provenance and artificial content. We present WAVES (Watermark Analysis via Enhanced Stress-testing), a benchmark for assessing image watermark robustness, overcoming the limitations of current evaluation methods. WAVES integrates detection and identification tasks and establishes a standardized evaluation protocol comprised of a diverse range of stress tests. The attacks in WAVES range from traditional image distortions to advanced, novel variations of diffusive, and adversarial attacks. Our evaluation examines two pivotal dimensions: the degree of image quality degradation and the efficacy of watermark detection after attacks. Our novel, comprehensive evaluation reveals previously undetected vulnerabilities of several modern watermarking algorithms. We envision WAVES as a toolkit for the future development of robust watermarks.
Bang An 0001, Mucong Ding, Tahseen Rabbani, Aakriti Agrawal, Yuancheng Xu, Chenghao Deng, Sicheng Zhu, Abdirisak Mohamed, Yuxin Wen, Tom Goldstein, Furong Huang
ICML8
2024 FACT or Fiction: Can Truthful Mechanisms Eliminate Federated Free Riding?
abstract
Standard federated learning (FL) approaches are vulnerable to the free-rider dilemma: participating agents can contribute little to nothing yet receive a well-trained aggregated model. While prior mechanisms attempt to solve the free-rider dilemma, none have addressed the issue of truthfulness. In practice, adversarial agents can provide false information to the server in order to cheat its way out of contributing to federated training. In an effort to make free-riding-averse federated mechanisms truthful, and consequently less prone to breaking down in practice, we propose FACT. FACT is the first federated mechanism that: (1) eliminates federated free riding by using a penalty system, (2) ensures agents provide truthful information by creating a competitive environment, and (3) encourages agent participation by offering better performance than training alone. Empirically, FACT avoids free-riding when agents are untruthful, and reduces agent loss by over 4x.
Marco Bornstein, Amrit Singh Bedi, Abdirisak Mohamed, Furong Huang
NeurIPS3