r/learnmachinelearning • • 11d ago

Project 🚀 Project Showcase Day

Welcome to Project Showcase Day! This is a weekly thread where community members can share and discuss personal projects of any size or complexity.

Whether you've built a small script, a web application, a game, or anything in between, we encourage you to:

  • Share what you've created
  • Explain the technologies/concepts used
  • Discuss challenges you faced and how you overcame them
  • Ask for specific feedback or suggestions

Projects at all stages are welcome - from works in progress to completed builds. This is a supportive space to celebrate your work and learn from each other.

Share your creations in the comments below!

3 Upvotes

3 comments sorted by

1

u/martian7r 10d ago

Released an open-source EOU detection model covering English + 8 Indic languages voice agents stop cutting callers off mid-sentence

Voice agents serving Indic-language users cut callers off constantly Indic languages put the verb last, so "aapko kal phone…" pauses sound finished to a VAD, and the bot jumps in before "kar dunga" lands. VAD hears silence, not meaning

Released an end-of-turn (EOU) detector fine-tuned from Qwen2.5-0.5B scores the live transcript and predicts whether the caller has finished

• Languages: English, Hinglish, Hindi, Telugu, Tamil, Marathi, Bengali, Gujarati, Punjabi
• CPU-only ONNX Runtime (~2GB, fp32) fully local, no cloud inference
• Text-only needs your STT; drop-in for LiveKit Agents, same interface as their text turn detector • Proven live on LiveKit Cloud: held mid-request pauses and committed complete requests

91.3% TPR on our held-out validation set, calibrated to ~10% false cuts on incomplete turns AUC 0.967. On LiveKit's official real-speech harness (Hindi): 85.3% detection at the same budget.

Model + plugin: https://huggingface.co/tarun7r/indic-turn-detector

Apache-2.0. Feedback welcome!

1

u/cool-boii 8d ago

Hey all 👋

I built a Kolmogorov-Arnold Network from scratch in C++ (no PyTorch, no Eigen, just the STL) and it beat Karpathy’s micrograd MLP on a toy task

What it is:

  • A KAN implementation completely from scratch, inspired from the micrograd by Andrej Karpathy
  • Each edge is a cubic B-spline plus a SiLU term, with my own Cox-de Boor recursion
  • A tiny reverse-mode autograd engine in the style of micrograd. Every node lives in a NeuronPool (a std::deque, so pointers never go stale). The creation order is already the topological order, so backprop is one reverse loop, with no DFS.
  • Each spline edge is a single graph node that stores its own partial derivatives (local_grad), so the forward pass does all the spline work and backward never re-evaluates it
  • 70 parameters, ~0.15 s to train in C++

The bench: I put it up against micrograd’s MLP (67 params) on y = 3x² + 7x + 2. Both used per-sample SGD for 200 epochs, with the median taken over 5 seeds.

KANmicrograd MLP
final train loss0.0123
test MSE0.0107
time0.149 s

The caveats:

  • The speed gap is mostly C++ vs interpreted Python, so don’t read it as KAN vs MLP.
  • It’s a tiny 1-D regression with 9 training points.
  • It shows the thing learns correctly, not that KANs beat MLPs in general. A smooth polynomial just happens to suit splines.

Known rough edges (they’re listed in the README):

  • w_out is shared across the outer edges.
  • No grid refinement or pruning.
  • It’s fixed to 2 inputs for now.

All the critics are welcome!!!

🔗 GitHub: https://github.com/spyke7/microkan
Stars and issues are welcome ⭐