glauberdebona

• glauberdebonaMar 11, 2025, 1:53 AM

  1 point

  0

  in reply to: glauberdebona’s comment on: Am­plify­ing the Com­pu­ta­tional No-Coin­ci­dence Conjecture

  Correcting myself: “doubly” just added above.

• glauberdebonaMar 11, 2025, 1:35 AM

  1 point

  0

  in reply to: Eric Neyman’s comment on: Am­plify­ing the Com­pu­ta­tional No-Coin­ci­dence Conjecture

  For the time-complexity of the verifier to grow only linearly with $O\left(\log 1/\epsilon \right)$, we need also to assume the complexity of the reduction $f_m$ is $O\left(|C{|}^{\gamma }\right)$ for a fixed $\gamma$, regardless of $m$, which I admit is quite optimistic. If the time-complexity of the reduction $f_m$ is doubly exponential in $m$, the (upper bound of the) time-complexity of the verifier will be exponential in $1/\epsilon$, even with the stronger version of Reduction-Regularity.

• glauberdebonaMar 11, 2025, 12:50 AM

  1 point

  0

  in reply to: Jacob_Hilton’s comment on: Am­plify­ing the Com­pu­ta­tional No-Coin­ci­dence Conjecture

  By “unconditionally”, do you mean without an additional assumption, such as Reduction-Regularity?
  
  I actually have a result in the other direction (an older version of this post). That is, with a slightly stronger assumption, we could derive a better upper bound (on $1/\epsilon$) for the time-complexity of the verifier. The stronger assumption is just a stronger version of Reduction-Regularity, requiring $Prob\left(f\right(C)\in \overline{V_0}|f(C)\in \overline{P})\ge \delta$ -- that is, $\overline{V_0}$ replaces $\overline{L}$ in the inequality. It could still lead to an exponential bound in $1/\epsilon$ if the complexity of the reduction $f_m$ increases exponentially with $m$. In the version presented in this post, the exponential bound relies on the complexity of $f_m$ being $O\left(|C{|}^{\gamma }\right)$ for a fixed $\gamma$, regardless of $m$, which is admittedly optimistic. If we assume this with the stronger version of Reduction-Regularity, then I think the upper bound for the time-complexity of the verifier would increase only linearly with $m=O\left(\log 1/\epsilon \right)$, which is a huge improvement (I can add something in the appendix about this if you are interested in the details). In the end, I opted for presenting the weakest assumption here, even if corresponding to a worse complexity bound.

• glauberdebonaMar 8, 2025, 11:24 AM

  1 point

  0

  in reply to: Jacob_Hilton’s comment on: A com­pu­ta­tional no-co­in­ci­dence principle

  Your comment seems to imply that the conjecture’s “99%” is about circuits $C$ for which $P\left(C\right)$ is false. Otherwise, it would be impossible for a $V$ to miss 100% of random reversible circuits without missing the circuits $C$ for which $P\left(C\right)$ is true. In the conjecture, should “random reversible circuits $C$” be read as “random reversible circuits $C$ for which $P\left(C\right)$ is false”? It does not change much indeed, but I might have to correct my presentation of the conjecture here.

• glauberdebonaMar 7, 2025, 9:34 PM

  1 point

  0

  in reply to: Eric Neyman’s comment on: A com­pu­ta­tional no-co­in­ci­dence principle

  I think I have an idea to make that 99% closer to 1. But its development became too big for a comment here, so I made a post about it.

Am­plify­ing the Com­pu­ta­tional No-Coin­ci­dence Conjecture

• glauberdebonaFeb 11, 2025, 2:09 PM

  2 points

  0

  in reply to: SMK’s comment on: Sleep­ing Beauty: an Ac­cu­racy-based Approach

  Thanks for the feedback! The summary here and the abstract in the draft paper have been updated; I hope it is clearer now.

Sleep­ing Beauty: an Ac­cu­racy-based Approach

• glauberdebonaFeb 5, 2025, 4:55 PM

  6 points

  0

  on: Open Thread Win­ter 2024/​2025

  Hi everyone,

  I’m Glauber De Bona, a computer scientist and engineer. I left an assistant professor position to focus on independent research related to AGI and AI alignment (topics that led me to this forum). My current interests include self-location beliefs, particularly the Sleeping Beauty problem.

  I’m also interested in philosophy, especially formal reasoning—logic, Bayesianism, and decision theory. Outside of research, I’m an amateur chess player.