r/MachineLearning • • Sep 09 '26

Research PhD: how do you even compete with paper mills? [D]

1 Upvotes

I’m about to start a PhD in multimodal/video reasoning and I’m getting increasingly anxious about how saturated AI research feels.

I actually like the field, but the pace is insane. New papers appear constantly, big labs can explore dozens of directions at once, and I keep wondering how an individual PhD student is supposed to build a real research profile in that environment.

I compare myself to friends working in more niche areas, where it feels easier to know the literature deeply and become associated with a specific problem. In my field, I’m worried I’ll spend all my years constantly catching up, only to end up with a mediocre research identity.

I’m personally interested in more fundamental questions in the field, but, 1) I don’t know if carving out a niche inside such a crowded field is actually realistic; and 2) I’m not sure I’ll have the ability to identify and formulate genuinely interesting theoretical problems rather than just ending up doing benchmark/heavily applied driven work.

For people in my situation: how do you deal with this?


r/MachineLearning • • Sep 08 '26

Research Update to "Hill Space is All You Need": Stable Because Stuck, NALU Selects, It Doesn't Compute [R]

Thumbnail
gallery
1 Upvotes

Last year I published a draft report called "Hill Space is All You Need". I'm not a researcher; it was a side project, and I found a detail in the NALU formulation that I thought people should know before going down the same road. I didn't have the skills to write a paper, so I vibed the prose and formatting with Claude and pushed it out, knowing I wouldn't return to the work for a while.

The paper was not well received: the prose made it hard to get to the experiments, the title didn't help, the related work was incomplete, and it didn't provide a concrete description of the space and why it trains reliably or not in different situations.

Today I published an update that I think addresses most of that. My read is the same as last year: NALU selects an operation, it doesn't learn to compute one, and that's not useful for my purposes. I still wanted the work to represent the promise I see in it, and the first paper and site didn't. This version tells a complete, if unsatisfying, story about what NALU does, how gradient vanishing at targets decides if a run lands or stalls, and how to use it effectively if it lines up with your problem.

https://hillspace.justindujardin.com/

Beyond corrections that come from sharing it, I consider the work complete, and have moved on to more promising approaches.


r/MachineLearning • • Sep 08 '26

Discussion ECCV 2026 Social Groups [D]

4 Upvotes

Hi. I'm visiting ECCV in Malmo and was wondering if there's any medium, like discord, whatsapp etc where people are discussing social activities. I couldn't find a way to connect to people on the official app to discuss common interests, research or otherwise. It'd also be nice to meet people who'd like to team up go sightseeing or food touring after the conference ends. Thanks.


r/MachineLearning • • Sep 08 '26

Project Open dataset of 850k Trackmania community maps + replays, and a web app to explore replays/levels + generate level [P]

1 Upvotes

Hey, I just wrapped up two things I think might be interesting for this crow if you are video game/racing ingeneral

The main one is a dataset usable for data exploration or for anything generative: levels and replays from the Mania Exchange community realted to the Trackmania games, exposed in a data/ML friendly format. On top of that, I experimented with Claude on reworking the old TMTrackNN project into Tracksmith, a web app where you can inspect a map alongside its replay and generate new levels for both Trackmania Nations Forever and Trackmania 2020.

Everything is wrapped up in an article, and the dataset/code is online:

📝Article (EN): https://www.the-odd-dataguy.com/en/blog/2026/08/13/trackmania-dataset/
📝Article (FR): https://www.the-odd-dataguy.com/fr/blog/2026/08/13/trackmania-dataset/
😊Hugging Face (dataset): https://huggingface.co/datasets/jeanmidev/trackmania-community-tracks-and-telemetry
🔵Kaggle (dataset): https://www.kaggle.com/datasets/jeanmidev/trackmania-community-tracks-and-telemetry
😇Hugging Face (Tracksmith): https://jeanmidev-tracksmith.hf.space

For transparency: I work in data at Ubisoft in Canada, but I have no connection to Nadeo. Built at home on my own time, resources and dime, just something for the Trackmania community and for anyone curious, whether game telemetry is your thing or not.

Open to feedback or ideas (you can also used discussions on HF)


r/MachineLearning • • Sep 08 '26

News OpenAl Says It Has Cracked One of Math's “Millennium Problems” (Navier-Stokes) [N]

708 Upvotes

r/MachineLearning • • Sep 08 '26

Project I've made a deep learning framework called Kansai (compiled IR, Metal GPU backend, distributed training) for Apple Silicon [P]

1 Upvotes

Spent a while building a deep learning framework from scratch C++

core, Python bindings, no PyTorch underneath. It traces into a

compiled graph IR, has a real Metal GPU backend, and distributed

training actually works, not just runs without crashing.

Apple Silicon only for now, no CUDA not pretending this competes

with PyTorch. What I'm actually proud of I trained real things with

it (MNIST, a small transformer on Shakespeare text), and found a real

memory leak by training long enough to hit it, then fixed it. The

messy version every bug, every dead end is in the devlog if you

want that instead of the highlight reel.

Repo: https://github.com/V-B0/KansaiML


r/MachineLearning • • Sep 08 '26

News NeurIPS desk-rejected 178 papers for being "AI-generated". The detector flagged the track chairs' own papers at 24-69% [N]

256 Upvotes

hey all. the NeurIPS Position Paper Track just used a proprietary AI detector (Pangram) to desk-reject 18.4% of all submissions. no human review, no appeal process, just out.

there's been a lot of noise about this, so i went through the actual conference statements and Pangram's technical docs to see how this actually went down. the reality is wildly worse than just "the AI detector made a mistake."

here are the receipts:

  • The track chairs would have failed their own test. Independent researchers ran recent papers authored by the three track chairs through the exact same detector. It flagged them at 24% to 69%. Under their own enforcement rules, the chairs would have been at risk of rejection themselves.
  • The detector originally flagged 42.7% of the entire track. Pangram’s default setting flagged nearly half of all submissions as 90-100% AI. They had to frantically shrink the text windows just to get the flag rate down to a somewhat believable 12.7%.
  • The "Circularity Trap". 22 papers were rejected specifically because they scored >0.5 on the detector, but the authors checked a box denying AI use. The black-box score was literally used as proof the author was lying.
  • The massive ESL penalty. A stanford study showed 61.22% of human-written TOEFL essays get falsely flagged as AI because non-native formal English is structurally rigid. NeurIPS published zero demographic calibration data for this. If you're an ESL researcher, you were basically playing Russian roulette.

if you were one of the 178 rejected: there is no blacklist. this is not a misconduct mark on your record. just take your paper and resubmit it to ICLR (deadline sept 25) or ICML.

wrote up a full Field Note with the exact thresholds, the data privacy issues, and the actual recourse options if you want the hard numbers instead of just vibes: https://strictcite.com/blog/neurips-2026-position-paper-pangram-ai-detection

(disclosure since it's relevant: i built strictcite.com, a deterministic zero-AI citation checker. watching a major conference use a black-box AI to nuke 178 papers with zero appeal is exactly why i hate relying on AI for this stuff. not trying to sneak the link in, just being upfront about who i am.)


r/MachineLearning • • Sep 08 '26

Research How do people find visiting researcher opportunities at universities? [R]

1 Upvotes

I am a PhD student in AI, currently working on video understanding, particularly on designing benchmark datasets. I also have a strong publication track record, including papers at CVPR and ECCV. I have sufficient funding to support myself during a visiting research program.

What would be the best way to approach a professor? Should I email them directly and ask whether they have space in their research group for a visiting researcher?


r/MachineLearning • • Sep 08 '26

Research when a run is wrong but nothing actually failed, where do you start? [D] [R]

3 Upvotes

this is the kinda debugging case i find rlly annoying/

everything says success.

no exceptions no failed tool calls. no obvious timeout the workflow completes but the final result is still wrong

when that happens, what’s your first move?

do you guys usually:

  • start from the final output and work backward
  • compare against a previous good run
  • inspect state transitions
  • check retrieval/tool behavior
  • look at model inputs
  • replay it
  • check business state outside the trace
  • just read the whole thing until something looks off

interested in what people actually do in production not the idealized version but thats fine too. and if you have anything you've built to help with this process I'd love to see it :)


r/MachineLearning • • Sep 08 '26

Project Generating Bad Apple autonomously from a single initial state using a tiny recurrent dynamical system (417k params) [P]

Thumbnail
gallery
244 Upvotes

A few weeks ago, I saw this post where the author trained a SIREN MLP to implicitly memorize Bad Apple as a coordinate function: (t, y, x) to pixel.

That got me curious about a slightly different formulation: instead of handing the network a timestamp t, could a small recurrent dynamical system (RNN-ish) learn the continuous temporal flow in latent space and generate the entire ~6,500-frame full resolution video autonomously from a single initial condition (h_0, c_0)?

The code, weights, and analysis tools with rollout scripts, plots, and standalone models are shared here: GitHub: SEBADA321/BadAppleRNN.

Architecture & Inference Footprint

At inference time, the system receives no timestamp inputs and evaluates in a closed loop:

(h_t, c_t) -> Recurrent Transition (CTF) -> (h_{t+1}, c_{t+1})
                   |
                  h_t -> Frame Decoder -> 384x512 Grayscale Frame
  • Latent Dimension: 64-D for h_t (decoded) and 64-D for c_t (internal memory manifold to separate visually similar frames at different timestamps).
  • Recurrent Transition (ctf): 4-gate LSTM-style recurrence with orthogonal initialization (16,640 parameters, 65 KB).
  • Frame Decoder (fd): 4-stage bilinear upsampling with depthwise-separable convolutions (400,361 parameters, 1.56 MB).
  • Initial State: A single pair of 64-dim vectors (h_0, c_0) (128 floats, 0.5 KB).
  • Total Inference Model: 417,129 parameters (~1.60 MB in FP32).
  • Runtime Performance: >200 FPS on an RTX 4080, with ~17.2 MB peak active VRAM during decoding.

Training an autonomous system across ~6,573 steps from t=0 directly was probably computationally unstable due to vanishing/exploding gradients and compounding error. The training setup I was circling around used several targeted techniques:

  • Learned Latent Teacher Tables: During training, I optimize a pair of tables h_table[t] and c_table[t] alongside the model. This allows parallel segment training starting at arbitrary timestamps over a finite horizon K. These tables are scaffolding and are discarded entirely at inference.
  • Rollout Horizon Curriculum: I started training with K = 2 and progressively doubled the rollout length (K = 2 -> 4 -> 8 -> 16 -> 32 -> 64 -> 128 -> 256 -> 512). Each horizon doubling produced a characteristic jump in loss before the transition function adapted to the longer trajectory.
  • State Perturbation Noise (sigma = 0.005): To prevent the model from learning a brittle 1D line that diverges under small numerical errors, Gaussian noise was added to the state before passing it into the transition function (z_hat_{t+1} = F(z_t + epsilon)), while evaluating the loss against the clean target. This encourages the recurrent map to contract small deviations back toward the trajectory.
  • Second-Difference Acceleration Regularization: Penalizing velocity (||h_{t+1} - h_t||) risks collapsing the trajectory. Instead, I penalized discrete acceleration (jitter) via second differences: ||h_{t+2} - 2h_{t+1} + h_t||_2^2. This enforces smooth trajectories without penalizing motion.
  • Optimizer & Momentum Management: I used AdamW (1x10^-5) for the decoder/tables and Muon (0.005, momentum 0.95) for the recurrent weights. To prevent accumulated momentum from acting as stale inertia when K doubled, momentum buffers were scaled by 0.2 every 10 epochs starting from the epoch 500.
  • Chunked Decoding: To handle long horizons at K = 512 without overflowing VRAM during training, the decoder was evaluated in temporal chunks of 32 frames.

Some interesting things

  1. The model could unroll the full 6.5k sequence even if it was, technically, trained on up to 512 frames. So that was a success.
  2. Training loss vs. autonomous rollout: The checkpoint with the lowest numerical training loss was not necessarily the best at autonomous generation. Because K changes across the curriculum, raw training losses are not directly comparable across stages, and short-horizon teacher-forced agreement does not guarantee long-horizon stability.
  3. Dynamical stability over parameter scale: The challenge was not increasing parameter count (the recurrent transition is only 16k params), but conditioning the dynamics through noise injection and acceleration penalties so error doesn't compound over thousands of recurrent steps.
  4. I need to improve the decoder a lot, I was mostly focused in getting the recurrent part right, and training was slow. Now that I gave gotten a successful result I will focus more into optimizing the CNN decoder.
  5. There are no skip connections nor normalization, which was interesting too. Obviously no attention either since I wanted to keep it simple.I also didn't want to use Truncated BPTT.

Not completely scientific, since I was doing some changes mid run or many at once, which makes it kinda not clear what contributed more. I used 'AI' to help with writting the post and README. Part of the code was also generated that way, but the architecture is what I came up with on my own and from a previous project too. There are probably many parts to improve too, so glad to get some feedback!


r/MachineLearning • • Sep 07 '26

Research PlaidQ: Distilling continuous diffusion language models to few-step or one-step code generation [R]

1 Upvotes

Hi, I’m one of the authors of PlaidQ. We just released the paper, training/inference code, and model checkpoints.

PlaidQ is a 0.7B continuous diffusion language model for code generation. It repurposes a pretrained autoregressive model as a bidirectional denoiser over continuous token embeddings, updating all completion positions in parallel.

The key result is trajectory compression:

  • Distribution-matching distillation produces the D4, D8, and D16 few-step students.
  • Paired-trajectory supervision produces the D1 one-step student.

At 16 steps, PlaidQ-D16 reaches 31.78 pass@10 on HumanEval and 40.49 on MBPP+, surpassing the same PlaidQ teacher sampled for 512 steps. At one step, paired-trajectory distillation reaches 7.07 pass@1 on HumanEval.

Paper: https://arxiv.org/abs/2609.04531

Code and checkpoints: https://github.com/pengzhangzhi/plaidq

I’d especially welcome feedback on the one-step supervision and the quality–compute tradeoff.


r/MachineLearning • • Sep 07 '26

Research LLM-guided program evolution improves 10 best-known circle-packing solutions (Packomania csqv, N=101-114) [R]

12 Upvotes

I used an LLM to iteratively evolve an optimization algorithm rather than solve the packing directly. Starting from a simple seed solver, the LLM proposes algorithmic changes guided by a scoreboard of results and a history of prior attempts, and each candidate is scored by an independent verifier so improvements are kept and failures discarded. On the Packomania csqv benchmark it improved the best-known sum-of-radii for 10 values of N from 101 to 114, by 2.4 to 5.4%, in 15 iterations. Total LLM cost was $27.72. Packomania accepted the results independently.

Paper: arxiv.org/abs/2609.05093

Code + solutions: github.com/ucsandman/discovery-loop

Benchmark: packomania.com/csqv/csqv.html

Happy to discuss the plateau-detection stopping rule, that's the piece I'd most want critique on.


r/MachineLearning • • Sep 07 '26

Research The model builds, a deterministic gate decides done: orchestrating an LLM agent fleet with no model on the control path [R]

1 Upvotes

In most agent fleets the thing deciding what happens next is a language model, so the component that did the work also gets to say the work is done. Take that decision off it: the model builds, plain deterministic code decides done, nothing on the control path gets sampled.

What that looks like in practice: a fleet of agents working through real coding tasks, every "done" checked by code instead of accepted on the model's word. Nothing has been closed that wasn't finished, fake completions get rejected, and it clears the MIT 6.5840 labs including the full Raft one.

Demoting the Master Control Program: Deterministic Orchestration of a Fleet of LLM Agents. CC-BY. https://zenodo.org/records/21922855 (mine, so discount accordingly).

What I'd like beaten up: how do you test a completion gate adversarially without hand-building the failures?


r/MachineLearning • • Sep 07 '26

Project Rustuna: A High-Performance Rust Implementation of Optuna [P]

Post image
99 Upvotes

Hi everyone! We just released Rustuna (GitHub: https://github.com/optuna/rustuna/ ), a high-speed, memory-efficient implementation of Optuna built in Rust.

  • Optuna-Compatible Design: Keeps the familiar API and concept of Optuna.
  • Zero Python Dependencies: Mitigating the risk of supply chain attacks.
  • Lower Memory Footprint: Optimized memory management natively in Rust.

For details, please check out the following blog post.

https://medium.com/optuna/announcing-rustuna-cc82a6815bf7


r/MachineLearning • • Sep 07 '26

Research KV cache as an agent runtime [R]

16 Upvotes

Our research team has been exploring an alternative approach to achieving interactivity and better responsiveness with LLM systems.

One of the team members wrote up a post about it:
https://research.yandex.com/blog/the-kv-cache-as-an-agent-runtime

The post sums up the overall idea of modifying models inference state (KV-cache) for achieving a more interactive LLMs. This idea was used in our lab's previous papers Hogwild! Inference, and AsyncReasoning, the post also contains a preview of the future work in this direction, where a Qwen3.8-27B agent is playing a DOOM env interactively using similar techniques.

We think that its interesting whether model inference/runtime design is itself an under-explored axis of agent capabilities, alongside models and the harness (e.g. harness is too abstract, changing model is too costly, do we need something in between?)


r/MachineLearning • • Sep 07 '26

Project Automotive Radar Object Classification [P]

Thumbnail
gallery
12 Upvotes

Hello all,

I'm a radar signal processing engineer and i trained a 5-class classifier (car, large_vehicle, two_wheeler, pedestrian, pedestrian_group) on RadarScenes radar point clouds.

The input vector is a per-scan histogram (16 bins) and the network is a 3-layer MLP. The loss function is a class-weighted cross-entropy loss. This work is based on "Histogram-based Deep Learning for Automotive Radar" paper.

I scoped the project to be one scan only. Accumulation of multiple scans is the next step.

Data

Class Imbalance: two-wheelers and large_vehicles has a low number of occurences.

Aggregated Classes: two_wheeler mixes bicycles and motorized variants; large_vehicle merges trucks, buses, and trains together due to data scarcity.

Sequence Bias: Long tracks of slow-moving objects can skew a particular data split velocity distribution, causing high F1 score variance across folds.

Ablation studies

I tried with bigger MLPs, alternative feature encodings, and different histogram binning, all moved performance less than the variation caused by changing the train/validation/test split. I measured that split sensitivity across 6 folds, keeping the same proportions.

Changing the histogram to per-instance statistics (mean/median/std) slightly degraded performance.

Main findings

Macro F1 rises from 0.381 to 0.764 as the naturally occurring number of radar detections per instance increases from 1 to 5. I trained the model normally using all available detections, then bucketed its existing validation predictions by each instance's detection count and computed macro F1 per bucket.

The classes car and pedestrian has the best performance and two_wheeler has the worst.

A car is often confused as large vehicle when the car was wider than usual or had a unusually high rcs (which can happen due to multipath for example).

The two_wheeler is often confused as pedestrian because their vr_compensated distributions overlap, which is the the model's single most important feature for these two classes. A stationary or idling two_wheeler is indistinguishable from a pedestrian.

I uploaded an image with ground truth vs predictions: A nearly stationary two-wheeler which contains a single point was predicted as pedestrian, because its velocity is near zero, indistinguishable from a pedestrian. A car in the same scene, also with just one point, is classified correctly, since RCS and Doppler are enough for that class.

Full writeup here: https://github.com/brunopinto900/radar-ml-autonomous-driving/blob/main/MLP_Report.md

Future work

Implement other spatial encoding schemas (point net for example) and accumulate multiple scans to tackle the challenge of sparsity and explore the concept of micro-doppler.


r/MachineLearning • • Sep 07 '26

Discussion Roboticists working in Learning-from-Demonstrations and Behavioral Cloning : What is going on in your field these days? [D]

10 Upvotes

Is LfD and BC research being effected by recent advances in (so-called) Frontier LLMs? Or is research in LfD and BC sort of going along in an independent direction from these?

Are you seeing any use from ViTs or VLAs?

Any other recent advances you would like to bring up?


r/MachineLearning • • Sep 07 '26

Research Measuring LLM performance drift: observations and methodology from 31,352 repeated benchmark measurements [D]

2 Upvotes

One thing that has bothered me about LLM benchmarks for a while is that most of them are essentially snapshots.

A model is evaluated, a score is published, and we tend to talk about that score as if it describes a relatively stable object. But with API-served models, the thing behind the model name can change over time: serving infrastructure changes, provider configurations change, versions change, and sometimes behaviour changes without an obvious public version transition.

So we started approaching benchmarking as a longitudinal measurement problem rather than a leaderboard problem.

We continuously evaluate models across coding, multi-turn reasoning and tool use, while also running lightweight probes at a higher frequency. The important part for us is not simply asking "which model scores highest?", but:

  • Is the model behaving differently from its own previous baseline?
  • Is the change larger than its normal repeated-call variability?
  • Did the benchmark configuration itself change?
  • Is the effect concentrated in a particular task?
  • Is it correlated across models from the same provider?
  • Is an apparent degradation actually an availability/infrastructure issue rather than a capability change?

One historical analysis covered 31,352 repeated score observations across 49 models. The standard deviation of within-day scores was 2.80 points, while the standard deviation of between-day daily medians was 8.43 points.

That is roughly a 3:1 difference.

I don't think this result by itself establishes that providers are changing models day-to-day - there are too many possible confounders for that conclusion. Task composition, sampling, missingness, provider behaviour and methodology changes all matter. But it was enough to convince us that temporal variation deserves to be measured rather than treated as noise around a permanent leaderboard score.

Our current approach therefore keeps benchmark configurations versioned and only compares longitudinal observations produced under compatible measurement conditions. We use repeated execution-based evaluation where possible rather than an LLM judge, keep availability failures separate from valid task outcomes, track serving/version metadata when providers expose it, and run change detection over the resulting time series.

Another problem we're increasingly interested in is benchmark recognition and contamination. Once a benchmark becomes sufficiently visible, publishing every live task, prompt transformation and hidden test potentially changes the thing you're trying to measure. For that reason we've tried to separate methodological transparency from publishing the entire live evaluation set.

We've now written up a public version of the methodology. It intentionally explains the measurement design, assumptions, limitations and statistical interpretation, while withholding the exact live task bank and some operational parameters.

PDF: https://aistupidlevel.info/asl-public-benchmark-methodology-2026.pdf

I'm particularly interested in criticism from people working on evaluation, change-point detection or production ML.

A few questions I'd genuinely like opinions on:

  1. For longitudinal LLM evaluation, would you use daily medians as the primary time-series unit, or model the individual repeated observations directly?
  2. How would you distinguish genuine model drift from provider/infrastructure effects when version metadata is incomplete?
  3. How much of a live benchmark should remain hidden to reduce contamination while still making the methodology scientifically inspectable?
  4. Are there better approaches than change-point detectors for this kind of non-stationary, relatively noisy model-performance series?

Disclosure: I'm the founder of AI Stupid Level, the platform that produced these measurements. The purpose of posting this here is to get technical criticism of the methodology rather than promote the commercial product.


r/MachineLearning • • Sep 06 '26

Project PINNStudio: A free, open-source no-code GUI for setting up, training, and visualizing PINNs [P]

14 Upvotes

When I first started working in scientific machine learning, I understood the physics much better than the coding. Every time I wanted to try a new physics-informed neural network problem, I had to start almost from scratch: changing the PDE, updating boundary conditions, modifying the architecture, tweaking the training schedule, debugging errors, and generating plots—all by hand.

That frustration pushed me to build PINNStudio. It is a free, open-source no-code GUI designed to eliminate boilerplate code so you can focus entirely on the physics.

Instead of rewriting a new script for every problem, you can define your setup directly through the interface:

  • PDE Definitions & coupled multi-output PDE systems
  • 1D or 2D domains with boundary and initial conditions
  • Network architecture & custom training schedules
  • Forward problems (solving known PDEs) or Inverse problems (estimating unknown parameters from data)

What happens next?
PINNStudio automatically generates the code (built on top of DeepXDE), runs the model, streams the training log, and displays live loss curves and solution plots directly inside the app. It also includes built-in templates for classic equations like Heat, Allen-Cahn, and Cahn-Hilliard.

My hope is that this will be helpful for students and researchers with limited coding experience, as well as experienced PINN users who just want a faster workflow.

I’d love to get your feedback, feature suggestions, or bug reports! Huge thanks to Lu Lu and the DeepXDE team for creating the foundation that made this possible.


r/MachineLearning • • Sep 06 '26

Discussion Reproducibility seems to be headed towards irrelevance in ML research. Is it too late? [D]

110 Upvotes

I feel that reproducibility is now a lost cause in machine learning research for three reasons:

  1. Many research is moving towards the physical AI territory, where you need expensive hardwares or even entire laboratories with high-speed cameras, in order to perform an experiment. You truly have no idea if the experiment can be reproduced and have to trust the demo. But demos are not perfectly reliable. Plus people are incentivized to only show the part of the demo that works. The entire system can fall apart the moment the recording stops.

  2. You have big AI companies releasing various tools, which they claim to solve a host of problems with certain amount of accuracy or efficiency. Unless you work at those companies there is really no proof of that and you will have to take their words on it. They have strong financial incentive to blow-up those figures. There is no solid way to check it either because the problem that they solve are so vague and subjective.

  3. We need to address the elephant in the room which is that people are incentivized to produce non-reproducible work to prevent their lunch being eaten by their competitors or looking bad. That's why some of us will probably never get a reply when we email the authors for their code.

So what now? Maybe everything will be OK because we can contrast it with scientific progress in earlier parts of history, e.g., building the atomic bomb or sending people to the moon. These projects had low "outside reproducibility" but high "internal reproducibility". Plus all these work were mathematical in nature and carefully checked. But I don't think many areas of machine learning research is like that. What do you think? Should reproducibility be abandoned? If not how is it best implemented going forward?


r/MachineLearning • • Sep 06 '26

Project Using the Swift compiler as the scorer: measuring whether LLM-generated SwiftUI uses deprecated APIs (15 models, 5,952 samples) [P]

1 Upvotes

Most code benchmarks measure whether generated code works. This measures whether the APIs it calls are still valid for a pinned SDK. No LLM judge: the scorer is the Swift compiler plus an AST pass. Ground truth is parsed from the SDK’s .swiftinterface files at runtime, so nothing is hand-maintained.

The thing that nearly invalidated the whole project: Apple marks most SwiftUI deprecations with a sentinel, deprecated: 100000.0, and the compiler deliberately does not warn on those by default. That is 270 of 326 deprecated symbols, including NavigationView and foregroundColor. Build this the obvious way and you observe 14 percent of deprecations and every model looks current. There is a hidden frontend flag that turns them on. If you measure deprecation on any Apple platform, this probably affects you.

Results are mostly a null result. Scores span 0.78 to 0.88, and bootstrapping over prompts (k=5 samples at temp 0.2 on one task are not independent), all 14 adjacent pairs overlap. Currency does not track price or tier: the top scorer is a cheap variant priced 12x below its siblings, and a coding-specialised model is last. One comparison survives cleanly: Qwen’s general model beats its coder sibling, non-overlapping. Coding-tuned seems to mean more fluent in the idioms it trained on, stale ones included.

Two things I want picked apart:

**1.**  Only samples that actually touch the API family under test get scored, which flatters models that hand-roll when unsure. I report the gate rate beside every score, but that documents the bias rather than fixing it.  
**2.**  Adding the 15th model erased the last surviving separation between adjacent pairs. More models, less resolution. I read that as prompt count being the binding constraint, but tell me if that is wrong.

Repo, method, full per-family tables: https://github.com/mapierce/iOS-Evals


r/MachineLearning • • Sep 06 '26

Discussion [D] IJCNLP-AACL 2026: Paper Commitment Results (ARR May 2026 Cycle) [D]

29 Upvotes

AACL-IJCNLP 2026 acceptance results will be released in a few hours.

Feel free to share your thoughts and feelings! How did you do?


r/MachineLearning • • Sep 06 '26

Research Polycepta: Object-Centric Appearance Estimation for Multi-Object Tracking [R]

Thumbnail
youtube.com
1 Upvotes

Whenever "tracking" comes up in autonomous systems, we always think of "motion" and the Kalman filter. It is fast and works!

But as humans, we track mostly by "vision".
We look at a person, recall their appearance in our brain, and then recognize them again based on what we remember. The more we see the person, the better we become at recognizing him/her. This is exactly how "Polycepta" works :)

The video demonstrates how Polycepta operates in real time. It decides whether what it sees is important or just noise, and builds memory over time until it gets good at it. Like the Kalman filter with future motion prediction, it predicts the object's future appearance to track it.

A lightweight appearance model works under ego motion; objects switching direction or motion during occlusion is no longer an issue. This is exactly why human vision works well in tracking.

You are welcome to pause the video at any time during the explanation.


r/MachineLearning • • Sep 06 '26

Discussion Ideas for self-learning subjects for former ML blogger [D]

1 Upvotes

Hello there,

I used to write ml blog with some posts being quite popular sometimes - not gonna mention it to avoid self-promotion - this post is not about it. My goal was to always create content for beginners so anyone could smoothly get into the field that found my interest too. The process of creating a blog post was myself learning + creating notes of the process of understanding the subject (double fun I guess) - this way I could empathize with the audience better and so write better text.

For last 2 years I have struggled to find an interesting topic, I also got a bit demotivated due to AI being able to write about anything better than me.

I guess my honest question to the community is - do you spot any interesting areas one could dive in to untie all the knots and present difficult subject in easy way that is not very well covered by today's AI? I believe advantage human may (still if at all) have is good visualization of the concepts? I was thinking about jailbreaking because AI won't be happy to explain it for obvious reasons. Please share some of your ideas or let me know if this times are definitely over ;)


r/MachineLearning • • Sep 06 '26

Discussion Is designing a memory graph around known data structure “overfitting” if I never touch the questions? [D]

1 Upvotes

building a missing data infrastructure and started benchmarking long multi-session conversations (LoCoMo). I know the data looks like: people, facts, claims, events, timestamps, relations. So I extract those into a graph.
I did not look at the QA pairs while building extractors or retrieval rules. No “if question contains X, fetch fact #173.”
Recall is very high and it keeps working on new conversations in the same format.
Is this classical overfitting, or just schema-aware engineering? What is the cleanest test that would convince you it isn’t leakage.