E.M. Rabani PRO
SkyMind
AI & ML interests
Neuromorphic NNs
Recent Activity
reacted to RiverRider's post with 🔥 about 9 hours ago
Natural Language Autoencoders: A Window into Latent Structure
I introduced a concise mathematical formulation of the P versus NP question into the SRT-NLA-AV-v1 demonstration:
P vs NP asks whether every problem whose solution can be verified in polynomial time (NP) can also be solved in polynomial time (P). Integer factorization — given N = p·q where p and q are large primes (p < q) — is in NP but widely believed not to be in P.
The resulting activation verbalization (best-of-N, reranked by AR fidelity) surfaced:
“This article originally appeared in the August 2016 edition of CACM. A new method of proving computational hardness of problems, known as multilinearization, can improve efficiency, reduce complexity and simplify proofs. In this article, I describe multilinearization and its application to several key problems, from the discrete logarithm and factoring to RSA and elliptic-curve discrete logarithms.”
What emerges is not a literal restatement, but a structured articulation of the model’s internal associations: hardness proofs, algebraic techniques, and the cryptographic implications that orbit this foundational question in computational complexity.
The demo offers a compelling interface for exploring these latent representations.
Explore it here:
https://huggingface.co/spaces/RiverRider/srt-nla-av-v1-demo
Recommended: Best-of-N sampling with round-trip evaluation for highest fidelity. liked a model about 15 hours ago
RiverRider/srt-nla-av-v1 reacted to salma-remyx's post with 🔥 2 days ago
The space of possible improvements for your AI model is large while evaluation is costly.
So I was excited to discover the ICML 2026 paper from Kobalczyk, Lin, Letham, Zhao, Balandat, and Bakshy titled "LILO: Bayesian Optimization with Natural Language Feedback."
The method learns efficiently from expert preferences, balancing exploration and exploitation in a principled way with Bayesian Optimization for expensive-to-evaluate black-box objectives.
Experimenting with the technique, I trained a Gaussian Process proxy model on the implicit preferences in my code repo's commit history at VQASynth.
The result: I used the model's preference scores to re-rank candidate papers recommended based on my interests in spatial reasoning and multimodal data synthesis.
Semantic relevance is a high-recall method for finding arXiv papers personalized to your interests. Adding contributor preferences, extracted from the merge history of your code offers a high-precision filter.
So what's next? I'm using the model to synthesize a larger volume of preference data to finetune an open-weight coding model with DPO and LoRA. Tuning Coding Agents via Implicit Preference Distillation
arXiv: https://arxiv.org/pdf/2510.17671
Substack: https://remyxai.substack.com/p/lilo-and-myx
VQASynth: https://github.com/remyxai/VQASynthOrganizations
None yet