Dipankar Sarkar PRO
AI & ML interests
Recent Activity
Organizations
PrunaAI/PrunaVAED
GODELEV/Rose-Mini
The tier is not the scarce thing. Concurrently running slots are.
I am on Pro and I sit under the same cpu-basic ceiling you do. Pro raised my ZeroGPU quota, it did not buy me a single extra cpu-basic slot. Back when I had 6 cpu-basic Spaces, the 4th one to wake while 3 were already running went PAUSED with "Quota exceeded for flavor cpu-basic". That reads like a build failure and it is not one.
The part that made it livable: a sleeping Space does not hold a slot. Two of my three are SLEEPING right now, hardware.current null, and they wake when someone opens them. So the ceiling only bites when several are awake at the same moment, which for most demos is never.
What actually fixed it was consolidation. I had 4 separate demos, folded them into one Space with tabs, and the slot problem stopped existing.
How many of yours genuinely need to be awake at once?
- ~1.7-2.1x faster decoder & ~50% lower peak VRAM
- Near-original visual quality & no changes to the latent encoding
Check it here: PrunaAI/PrunaVAED
CPU, CUDA, PyTorch, and ONNX are supported. Apache 2.0.
See it for yourselves:
owensong/Inflect-Micro-v2
owensong/Inflect-Nano-v2
Try the Demos:
Nymbo/Inflect-TTS (unlimited CPU usage)
owensong/Inflect-v2 (ultra-fast ZeroGPU usage)
TL;DR:
This article argues that a weaker claim can be the more trustworthy result.
When evidence, scope, freshness, or boundary visibility cannot support the requested wording, a governed system should not overclaimโand it should not always collapse into silence. 259 treats downgrade as claim-sizing: preserve the strongest statement that remains useful, bounded, and true.
Read:
kanaria007/agi-structural-intelligence-protocols
Why it matters:
โข prevents weak evidence from being inflated into strong assurance
โข distinguishes honest narrowing from rejection or refusal
โข preserves useful truth when the strongest claim fails
โข makes freshness, scope, and boundary limits visible
โข aligns runtime, review, assurance, and publication language
Whatโs inside:
โข the distinction between DEGRADE, REJECT, NOT ADMISSIBLE, and OUT OF SCOPE
โข a practical ladder for finding a supportable lower claim
โข downgrade causes: evidence insufficiency, scope narrowing, freshness decay, and boundary uncertainty
โข claim, artifact, and review-posture downgrades
โข limit-disclosure notes and claim-downgrade registers
โข wording patterns for saying less without becoming vague
Key idea:
Do not say:
*โwe cannot prove the strongest version, so we will either publish it anyway or say nothing.โ*
Say:
*โthe requested claim is too strong for the available support, but this narrower claim remains admissible under these scope, freshness, evidence, and reliance limits.โ*
Honest systems do not always speak strongly.
They speak no larger than their support.
Sol-Attn: Accelerating Video Generation Inference via On-the-Fly Attention Sparsification
PerceptionBench: Evaluating Atomic Visual Perception in Multimodal Large Language Models
OmniDelta: Skill-Driven Budget Allocation for Token Compression in OmniLLMs
Novel Claim or Dรฉjร Vu? Rethinking "Contamination-Free'' Dynamic Evaluation for Multimodal Automated Fact-Checking
One flipped probe is carrying the architecture claim.
4/5 to 3/5 and 4/5 to 4/5 differ by a single binary outcome on a 5-prompt eval. At that resolution "architecture-dependent" and "ran it twice" are the same measurement. Worth pinning down before the TIES merge, because a merge scored on those same 5 probes cannot report anything either.
The resample idea is the right instrument, but you have aimed it at the teacher. DeepSeek-V4's entropy tells you about DeepSeek-V4. The number that changes what you do next is entropy on your own checkpoints: ask one unverifiable question k times at temperature, watch the number token. Low entropy and stable means the fabrication is confident, and no volume of SFT on that objective reaches it. Spread across k means the model was guessing and the keyword labels threw that signal away.
No training, no teacher, no merge. It runs on all 16 checkpoints you already have.
What does k=20 on Hermes-3 look like, before and after the tune?
Then you already have the expensive part.
A pinned harness makes the base spread a one-time measurement, and it doubles as the pass/fail line for the instruct checkpoint. Inside the spread, the tune cost you nothing measurable. Below it, real regression. Without the band those two look identical.
Best part is you get to set that line now, before the instruct recipe exists and before it is tempting to move it.
What drop on ArithMark-3 would you accept to ship the instruct checkpoint?
Self-reported is fine, and for at least one entry you would not have to trust the report at all.
GODELEV/Rose-Mini ships training_meta.json next to the weights, with tokens_seen: 12206861568 and params_M: 49.443. Machine readable, already public. A leaderboard that reads that file gets a verified number for free, and falls back to the form field only when the file is missing. Once the column exists to reward it, one small JSON is a cheap ask of a submitter.
On the comparison, the card argues the other way. Rose X1 is described there as an efficient decoder-only design with GQA, RMSNorm, QK-norm and refresh gates, and the author's own line is that the goal was never to reinvent the Transformer, only to explore it. config.json backs that up: 14 layers, 8 heads, 2 KV heads, RoPE at theta 1e5, and refresh_gate_inject_layers [4, 9]. Two injection points in an otherwise standard decoder stack is exactly what a shared benchmark exists to price.
Pulling it out also costs Rose-Mini its best result. 49.4M parameters at 12.2B tokens landing in BananaMind 2 Medium's range only reads as a finding from inside your table.
Would you rather scrape tokens_seen from the repo, or take it on the submission form?
Benchmark WikiSB | Gemma3_270M
BoolQ 37.8 | 61.4
ARC Challenge 24.2 | 28.2
HellaSwag 26.3 | 37.7
PIQA 53.5 | 66.2
Winogrande 50.2 | 52.3
Summary:
Closest benchmark: Winogrande (2.1-point gap)
Strong performance: ARC Challenge (4.0-point gap)
Moderate gap: HellaSwag and PIQA
Largest gap: BoolQ (Reading Comprehension)
It shows despite the training difference between Gemma3 270M and WikiSmartBotLM, It does come close to Gemma 3 in some benchmarks.
pranavupadhyaya52/Wiki-SmartBotLM-Instruct
Learnt things the hard way, wrote it down so you don't have to.
https://huggingface.co/blog/adalat-ai/whisper-token-limit
Most GUI agent work assumes the agent lives inside the device or
drives it through a debugging interface. We went the other way.
Aiden is a small board that sits outside the host. It captures the
screen over HDMI-to-CSI, runs the agent loop on-device, and sends
actions back as a standard USB HID device โ the host sees a keyboard
and a mouse, nothing else. No app install, no root, no ADB, no cloud.
Runtime is Go. Frame capture, full-duplex audio with VAD, the agent
loop, and HID output all run as independent goroutines. There's no
backend โ nothing leaves the device, which is the only defensible
design when the input is a live feed of someone's phone screen.
Open questions we haven't solved:
ยท Action verification โ inferring success from a re-read of the
screen breaks when loading states lie
ยท Prompt injection โ an agent that reads screens reads whatever an
attacker puts on them
ยท iOS pointer control requires AssistiveTouch
Repo, including the HID gadget config and capture pipeline:
github.com/AidenAI-IO/aiden-hardware-demo
Wrote up how this differs from cloud-based computer use agents here:
https://aidenai.io/blog/mobile-ai-agent-vs-computer-use-agent-whats-the-difference/
Note: current hardware is a dev board, not a finished product.
Following up on my neural-aarch64-units (small MLPs that emulate CPU datapath slices, verified bit-exact over their entire finite input domain โ N/N), I applied the same discipline to memory and storage. Three new repos:
๐ท neural-ddr โ verified units emulating DDR5 logic: DBI (256/256, 512/512), ADDR_MAP (4096/4096), CMD_DECODE (32/32), WR_CRC (512/512), and on-die ECC ODECC (256/256, 3328/3328). Composed into a bridge that presents DDR5 behavior over real DDR3/DDR4 RAM โ flip a bit in every stored byte, ECC corrects all of them.
๐ค Quazim0t0/neural-ddr ยท ๐ป https://github.com/quzi93/neural-ddr
๐๏ธ neural-storage โ a self-healing vault on a neural-verified GF(2โธ) core (LOG/EXP compose to a multiply verified over all 65,536 pairs). Content-addressed dedup + Reed-Solomon so any k of n shards rebuild the whole, plus a whole-drive โ self-healing .pt imager.
๐ค Quazim0t0/neural-storage ยท ๐ป https://github.com/quzi93/neural-storage
๐ฟ neural-cd-preserve โ scan a disc into a self-healing .pt that detects (per-shard SHA-256) and repairs bit-rot, restoring bit-exact even from a damaged copy. Beyond the RS limit it's flagged LOST, never silently wrong.
๐ค Quazim0t0/neural-cd-preserve ยท ๐ป https://github.com/quzi93/neural-cd-preserve
Build your own: golden finite function โ enumerate the domain (decompose big/linear ops like CRC/ECC/GF into bit/byte slices) โ train a small MLP โ verify must be bit-exact on 100% of inputs or it's rejected โ compose. Every repo ships the training + exhaustive-verification scripts.
Honest by construction: dedup removes redundancy, erasure coding adds it, ECC corrects faults โ none of it pretends to beat entropy. Runs on modest/older hardware. ๐ค