cryptohell
Re:Can we bootstrap AI Safety despite being unable to even define it?
on Thursday November 13, 2025 @06:12PM (#45921963)
Given several models, assuming only that some unknown subset is "safe", can we construct a single model as safe as that subset? This reduces obtaining a trustworthy model to a plausibly easier task.
Can we bootstrap AI Safety despite being unable to even define it?
Re:Optimality of Frequency Moment Estimation
on Wednesday December 25, 2024 @11:27AM (#42509528)
The classic AMS (1996) bound for estimating the frequency moments of a stream is shown to be optimal
Optimality of Frequency Moment Estimation
Re:LLMs can hide arbitrary undetectable information in their responses
on Monday January 22, 2024 @04:51PM (#39095986)
ChatGPT could encode usernames, timestamps and other session context into its responses in a way that would only be retrievable by OpenAI and provably invisible to everyone else
LLMs can hide arbitrary undetectable information in their responses
LLMs can hide arbitrary information in their responses, undetectably
Undetectable Watermarks for LLMs
Undetectable Watermarks for LLMs
Undetectable Watermarks for Language Models
Re:Undetectable Watermarks for Language Models
on Thursday June 15, 2023 @09:40PM (#36349828)
How many people do you think actually bother rephrasing LLM outputs? Do you personally ever copy paste a full chunk of a response?
Re:You can watermark GPT's outputs discreetly
on Friday June 02, 2023 @08:49AM (#36164385)
You draw the first bit to be 0/1 with equal probability, and then the second bit must equal the previous one with probability 1
Re:You can watermark GPT's outputs discreetly
on Thursday June 01, 2023 @11:41PM (#36160693)
True, they claim in this paper this is inevitable
You can watermark GPT's outputs discreetly
(Provably) Undetectable Watermarks for LLMs
Re:Planting Undetectable Backdoors in Machine Learning Models
on Sunday February 26, 2023 @12:25AM (#34943297)
(A Turing award winner and a Godel prize winner professors at Berkeley and MIT)
Re:Planting Undetectable Backdoors in Machine Learning Models
on Sunday February 26, 2023 @12:24AM (#34943289)
There are several differences:
1. Empirically, networks have many adversarial examples. It doesn't mean though that there are adversarial examples everywhere. They show that any point can be slightly changed to get whichever output.
2. Some training algorithms that already exist or will exist are meant to be robust. They show that even with a robust algorithm the backdoor will still exist.
3. As you said, they show that finding the backdoored point is also efficient to the key holder.