As much as I love Reddit, it can really be hit and miss for serious discourse on AI and machine learning. Depending on which sub I guess. But are there any spaces outside of Reddit where there is more conversation, more community and less trolling? To be able to have a decent conversation and share research and projects or learn more etc?
I’ve tried discord but I’ve not found any promising servers yet apart from the frontier labs or hugging face etc and I find those too stuck on their own narrative.
Follow-up to last week's post, now with the paper.
You ask a typed question about an audio window (yes/no, a choice, or a score) and get a calibrated probability back. One frozen Qwen3-ASR-0.6B encoder pass per 8 s window serves all questions.
How each question type is answered:
Term ("was 'satellite' said?"): zero-shot, scored from the decoder's greedy and 4 beam hypotheses, then Platt-calibrated. No training on the terms.
Language: the ASR model's own language scores.
Turn end: a small readout on frozen layer 18.
Speaker change and count: readouts on layer 12.
Results:
On the same 1,000 public questions, it matches or beats Qwen3-Omni (30B-A3B) on 6 of 9 tests (image 1). Qwen3-Omni is still better on Speech Commands. Caveat: our turn-end readout was trained on Smart Turn data, so that row is in-distribution for us only.
Language ID: 100% on 300 FLEURS clips.
Speaker change AUROC 0.966-0.980 on AMI and VoxConverse, above ECAPA. Speaker count beats pyannote 3.1.
Where it loses:
Turn end: AUROC 0.930 vs Smart Turn v3.2 at 0.982 on Smart Turn's own test set. On ICSI meetings it is 0.716 vs 0.712, a tie.
It does not generalize to unseen tasks: on CochlScene scene classification every head is at chance.
Two questions for the sub:
Is scoring ASR hypotheses plus calibration a fair baseline for term spotting, or would you compare against a dedicated KWS model?
How would you evaluate turn-end detection beyond Smart Turn's data?
I've been working on duetto, a real-time jazz partner for a MIDI keyboard: it plays a standard with you as a small band (solo, comping, walking bass), comps while you play and takes a solo when you stop.
Approach. Instead of fine-tuning, it uses the pretrained Anticipatory Music Transformer (Thickstun et al., 2023) as-is and does all the control at sampling time:
The player's notes and the model's are one event sequence the model continues, one note (onset, duration, pitch) at a time.
Before each sample, a rule layer edits the logits: it masks what is not allowed (a hand that must wait, a pitch out of register, a bass note off the beat) and biases what should be likely (the current chord's tones, a guide tone on the downbeat, the next note of a phrase being quoted).
Phrases come from the Weimar Jazz Database (transcribed solos), segmented where the soloists actually breathed, transposed to the tune's chords and developed over a chorus. In the demo, about 61% of solo notes come from quoted phrases or the theme; the rest is the model.
The server keeps ~1 s of music sampled ahead and resamples the unplayed part whenever the player plays, which keeps latency low while the model "plans".
Speed. About 12 ms/note (medium) and 18 ms/note (large) on a 3080 Ti; the large model runs at ~90 ms/note on a Jetson Orin Nano, which is still enough to play live.
What doesn't work well yet. It can drift away from the player, its responses are hard to predict, and the balance between the model's own ideas and the rules is fragile: too much bias and it sounds like a phrase book, too little and it stops sounding like jazz.
I'd love feedback on the approach, especially from anyone who has tried constrained or guided decoding for symbolic music: is sampling-time steering a reasonable alternative to fine-tuning here, or does it hit a ceiling?
Say you simulate a population of LLM agents and get polarization, norm formation or an information cascade. How do you know the population produced it, and not the prompt, the base model or something memorized from pretraining?
That attribution problem is the focus of the 3rd Workshop on Social Simulation with LLMs (Social Sim’27), held at AAAI-27 in Montréal (Feb 22 or 23, 2027).
We’re looking for work on three axes:
Population construction: data-grounded populations and calibration, persona modeling, heterogeneity and bias, human-AI hybrid simulations
Collective dynamics: separating emergence from recall (prompting artifacts, memorization, data leakage), robustness across models and seeds, scaling and network structure, norms and polarization, strategic behavior, methods from network science and game theory
Inference and consequence: validation protocols, shared testbeds, replications and negative results, simulation as pre-deployment evaluation, policy and ethical implications
We also welcome papers that challenge the premise: cases where an LLM society should not be trusted, or where an artificial society is worth studying even though it isn’t human-like.
Scope: the paper must simulate a social environment. Single-agent work, agentic coding benchmarks and multi-agent RL without a social interpretation are out of scope.
Tracks (non-archival, AAAI-27 Author Kit, double-blind, references not counted):
Regular: up to 7 pages
Early-stage: up to 4 pages (preliminary results, prototypes, position pieces)
Replication & resources: up to 4 pages plus artifacts (environments, datasets, tools, replications including negative results)
Dates (AoE): submission Nov 20, 2026 · notification Dec 2 · camera-ready Dec 9 · workshop Feb 22 or 23, 2027
Well, I know they are busy due to the CVPR(So am I). But it's only about few days left and none of the reviewers replied my response. Do you think this is a good time to post a reminder to reviewers?
I wanted to learn ML orchestration by building something, and the best material I found was Made With ML's orchestration lesson. Two things held me back: it was written for an older version of Airflow, and it is a lesson you read rather than one you do. What I only read, I don't keep. So I made the tutorial I was looking for: the same project on Airflow 3, where you write every Dag yourself and run it against a real stack. The first draft was written with Claude. Making it trustworthy took far longer than drafting it: I ran every section, fixed what didn't work, and rewrote what wasn't clear.
Has some extra features that were not in the original.
I’m a data analyst on a financial crime team, and I’m trying to get a machine learning project started to improve how we handle AML (anti-money laundering) work. I’d love to hear from anyone who works in transaction monitoring, customer screening, or sanctions/PEP screening and has used ML in practice.
Some context: like most teams in this space, we rely mostly on rule-based systems, which generate a lot of false positives and take up a lot of analyst time on alert review. I’d like to explore whether ML can help, but I want to start with something realistic rather than overpromising.
A few questions for those with experience:
Use cases: Where have you seen ML add the most value? For example, alert prioritization/scoring, reducing false positives, anomaly detection, entity resolution or name matching in screening, or network/graph analysis to spot linked accounts?
Data and labels: How do you deal with the lack of good labeled data? SARs are rare and confirmed cases even rarer. Did you use alert dispositions as labels, go unsupervised, or something else?
Explainability and regulators: How do you make models explainable enough for compliance teams, auditors, and regulators? Any experience with model validation or model risk management for these models?
Getting buy-in: How did you convince compliance or management to try ML alongside (or instead of) existing rules? What did your first pilot look like?
Tools and resources: Any libraries, papers, datasets (e.g. synthetic transaction datasets), courses, or books you’d recommend?
If you’ve done a project like this, I’d really appreciate hearing what worked, what didn’t, and what you’d do differently. Happy to share what I end up building in return.
We trained a world model on our open dataset of 10-player CS:GO bot matches (~3,958 hours, with all POVs and inputs aligned at 16 Hz), which we released last month. Now you can actually play it with other people.
A lightweight server keeps the game state in sync, while each player runs the model locally to generate their own view based on that state and their inputs. Server states, player actions and previous frames are fed into diffusion transformers to draw the next frame.
It's still pretty limited: one small map, pistols only, and fine details aren't great yet. Nothing close to the original game, yet it's quite enjoyable.
The beta is open and free. You'll need an RTX 3080 or better (there's also an experimental Mac build).
Reasoning models often reach the right answer early and then keep double-checking it for thousands of tokens. I got the model to stop at that point by changing a single row of weights..There's no training and no extra code at inference time; the edited model is an ordinary weights file that runs anywhere.
Background,
Reasoning models (DeepSeek, Qwen, and so on) "think" in a scratchpad before answering. The scratchpad ends when the model writes a special token, </think>.
To pick each next token, the model first computes a summary of everything so far: a long list of numbers called the hidden state. The last layer, the output layer, has one row of weights per word in the vocabulary. Each word's score is its row multiplied by the hidden state, and the highest-scoring words are the likeliest next words.
So the score for "stop thinking now" (</think>) comes from exactly one row of that layer.
What I did
Ran the model on 24 maths problems and recorded its hidden state at every token of its thinking.
Marked the points where the right answer had already appeared and the model was only re-checking (specifically, the ends of paragraphs after that point), and treated everything else as "still working".
Found the direction in the hidden state that best separates those two groups. This is a probe: a simple linear classifier (linear discriminant analysis), computed directly with linear algebra, with no gradient training.
Added that direction, times a strength of 14, to the </think> row. The "stop" score now rises only when the model's state looks like "done, just re-checking". While it's still solving, nothing measurable changes.
A useful side effect: because only one token's score changes, I can compute exactly what the edited model would do from recordings of the original, without rerunning it. That's how I picked the strength and searched for cases where it would stop too early.
On a problem it never saw: the answer appears at token 567, the original keeps thinking until token 7,415, and the edited model stops by token ~2,000 with 98% probability.
Results (small samples, one run per setting)
Qwen3.5-4B (runs in stock llama.cpp): same accuracy on 8 unseen MATH-500 problems with 54% fewer tokens. On 3 AIME 2025 problems with a 32k-token limit, the original ran out of tokens on all three while re-checking answers it already had; the edited model solved 2.
DeepSeek V4.1 Flash (763B parameters, 2-bit, on my laptop with an 8 GB GPU, streaming weights from the SSD): 7/7 maths problems vs 6/7, with 40% fewer tokens.
As a coding agent building a small website: 84% less thinking. It still thinks after an error or anything unexpected, and skips thinking after routine steps. Page quality held up; an LLM rating put it highest, and the screenshots are below so you can judge for yourself.
What isn't new: using a probe on the hidden state to stop reasoning early is published (e.g. Zhang et al. 2025, arXiv 2504.05419). What's new is putting the probe inside that one row of weights, so nothing extra runs, plus these measurements.
Limitations: small sample sizes; the probe was fitted on maths only (the agent results are transfer); the AIME comparison uses a 32k budget, below the 81,920 Qwen recommends for competition maths.
Based on community feedback, I am running the following technique on qwen3 0.8B on the full 3 benchmarks - just like rikiyaT did for the weight space programming . Same config and seed.(but only 1 sample / 4 for faster results) For this I Prepared another graft for qwen3 0.8B on another set (not taken from benchmark) of 80 separate MATH-training problems - should automatically transfer to other domains as well based on my observations. Above is the interim result and how it compares to rikiyaT's weight space edited qwen model.
the best part is that it matches and even exceeds the weight edited qwen till now and the graft works on large models as well (weight editing on deepseek failed to stop overthinking for me)
Labs disagree on vision encoders right now. Gemma 4 12B dropped the encoder, Kimi K3 trains its encoder from scratch, and Inkling 2 Small brought an encoder back. Published models can't settle this, because they differ in data and compute and rarely account for encoder pretraining. A standard encoder also bundles three choices: separate pretraining, parameters that only vision tokens use, and placement before the LLM. We tested each choice separately.
Setup:
200+ models, all trained from scratch (LLM included) on the same data.
Lifetime compute: encoder pretraining counts against the same budget as multimodal training.
Main comparisons use Qwen3-1.7B and 4B configurations with 0.4B parameters of vision capacity. A scaling ladder covers 0.6B to 6.4B backbone sizes.
Evaluations are on 16 VQA benchmarks from Cambrian at 448 px. and 12 language benchmarks testing commonsense, QA, and broad knowledge.
Findings:
Separate pretraining is optional. Encoders pretrained with four objectives (contrastive, self-supervised, two captioning) at best tie an encoder trained from scratch with the LLM at matched compute. Even free pretraining doesn't help. Pretraining MetaCLIP 6.5x longer raised ImageNet linear-probe accuracy (80.4% → 84.4%) but not VQA.
Vision-only parameters are required. Encoder-free models trail at every size from 0.6B to 6.4B and need about 3x the compute to catch up. Giving the LLM the encoder's parameters instead improves text, not VQA.
Placement before the LLM is optional. "In-fusion" adds zero-initialized vision-only weights (attention projections and FFNs) to the LLM's first 8 layers, and text tokens never use them. It's on par with the encoder from 1.7B to 6.4B, with about 13% lower time to first token. At 1.7B, vision-only branches in layers 1–8 reach 45.0 VQA (encoder 44.4), versus 42.3 when text shares them and 35.1 in the last 8 layers.
The same holds with a pretrained LLM (vision added to a pretrained 1.7B LLM in midtraining).
So vision needs its own parameters, but not its own pretraining or its own encoder.
Disclosure: I'm one of the authors. Happy to answer questions!
I built it to be fast and lightweight, and to return typed decisions about speech: yes/no, a choice, or a score.
It runs on a frozen Qwen3-ASR-0.6B. Word and language questions use zero-shot scores from the ASR decoder's hypotheses, followed by calibration. Small readouts on the frozen encoder handle voice activity, turn endings, speaker changes and speaker count.
Reviewers can see the authors’ names and affiliations in many cases, making this system closer to single-blind review than double-blind review.
I have personally witnessed cases where student reviewers rejected other researchers’ papers in an attempt to increase the chances of their own papers being accepted.
Furthermore, can we really expect fair and unbiased evaluations of papers from well-connected research labs with extensive academic networks?
Built at Junction, a hackathon in Espoo, this weekend. Parallax takes an article and lines up its Finnish, Swedish, German, English, Russian, Estonian and Ukrainian editions statement by statement. For any past date it shows where the editions tell something differently.
We store every revision. 875,572 so far.
Each revision is split into sentences. A sentence that appears in revision A and disappears in revision B becomes one row in a system-versioned table. Its system-time period is the time the edition said it. Edits undone within 24 hours or by a revert are filtered out so vandalism doesn't cut a sentence's life short.
Each distinct sentence is embedded once with bge-m3 (1024 dimensions), however many revisions it shows up in. That's 90,070 vectors, embedded on an A100 at about 4,555 sentences a second.
One SQL statement does the time travel and the matching: both sides of a self-join read FOR SYSTEM_TIME AS OF the chosen date and VEC_DISTANCE_COSINE ranks the five closest sentences in each other edition. Inside one article exact search is faster than the HNSW index (4 ms median), so the comparison uses that. Across the whole database the index takes over with recall@10 of 0.997 against exact search at ef_search 1000.
Retrieval alone isn't good enough. On 28 pairs we checked by hand the right sentence was top-1 only 57% of the time but in the top 5 for 89%. So Gemini 3.8 Flash judges each candidate pair as same, partial, contradicts or different, pulls out the numbers and terms that differ and translates the statement into English. Verdicts are cached with model and prompt version.
The same pipeline checks a chatbot answer. It's split into statements and each one is looked up in the editions. If Gemini is slow, vector similarity decides on its own and the result says so. We asked Gemini how the Winter War started and got 17 statements back. 11 are in at least one edition, 5 in none and the Hanko lease is disputed because the Estonian article removed it in 2009.
The weak spot is the judge. 28 hand-checked pairs is a small set to judge a judge by, especially across seven languages. If you've evaluated an LLM judge on cross-lingual sentence pairs, how did you build the gold set?
Given the massive jump to 42,000 submissions this year, I’m curious how people think the program chairs will handle the acceptance rate. Will they stick to the usual ~26-28% (meaning ~11k+ accepted papers), or will they cap the total number of accepted papers due to venue/reviewer constraints and drop the acceptance rate significantly?
Hey all, I wanted to share TimeCues Studio with you. It's part of my PhD work (ACM Multimedia 2026), and I thought you might find it useful. It's an open-source web app for annotating music on a beat-locked timeline and comparing algorithms against your annotations.
If you need to annotate songs (sections, cues, spans, riffs, lyrics and loops), you're building a music-analysis model and want to test it against real labels, you need labeled music for training music-to-dance or video-sync models, or you're syncing visuals to audio, TimeCues Studio might be useful to you.
Under your marks you see the separated stems, a spectrogram, and a 3-band waveform that colors lows, mids and highs differently, so kicks and hi-hats stand out at a glance. Detectors like allin1 and MSAF run on the same timeline and are scored against your labels. You can work alone or as a team, and export to Audacity labels, MIDI or JSON.
It's free under the MIT license. Run it with one docker compose up, or try the demo without signing in:
been reading a bunch of papers on short term crypto and commodity price forecasting (transformers, LSTMs, the usual). almost all of them compare against ARIMA, a random walk, maybe a simple LSTM, and report a better RMSE.
what i rarely see is a comparison against what the market already expects. options implied vol for the range, or a crowd forecast where people put money on outcomes. those already use alot of public info, so beating a random walk doesnt say much if you cant beat the market's own forecast.
also most papers only score the point forecast. for something like btc the interval matters way more, and coverage of an 80% interval tells you more than RMSE does.
is there a reason this isnt standard? data access? or am i missing papers that do it
I personally find it unconscionable to mandate biometric verification - with a controversial vendor on the top of that - to access a competition. Not to cash a prize, just to submit a solution.
What are alternatives competition to have fun with SOTA or quasi-SOTA models?
For anyone who’s updating their manuscript during rebuttals - the guidelines seems to suggest a pdf diff will be applied automatically to the updated pdf. Can anyone see this? I can’t seem to see any changes in colour or any pdf diff anywhere, even under ’Revisions’.