Feeds to Scour
SubscribedAll
Scoured 185598 posts in 26.9 ms
MathConstraint: Automated Generation of Verified Combinatorial Reasoning Instances for LLMs  🧮SMT Solvers
arxiv.org·19h
Online Set Learning from Precision and Recall Feedback  🧮Vector Databases
arxiv.org·19h
nooga/let-go: Almost Clojure written in Go.  🔵Clojure
github.com·4d·Lobsters, Hacker News, Hacker News
Improving search efficiency via adaptive acquisition function selection in discrete black-box optimization  ⏪Deoptimization
arxiv.org·19h
A Learning Method for Symbolic Systems Using Large Language Models  🌳Pratt Parsing
arxiv.org·19h
GB10 Solution Atlas is now open source, <2min cold start 100 tok/s Qwen3.6-FP8  🎨WGPU
github.com·6d·Hacker News, Hacker News
Compute Where it Counts: Self Optimizing Language Models  📱Edge AI
arxiv.org·19h
Dsat: A Native SAT Solver for Discrete Logic  🧩Constraint Programming
arxiv.org·19h
jonghough/jlearn: Machine Learning Library, written in J  🧠Machine Learning
github.com·5d·Lobsters
LLM4Branch: Large Language Model for Discovering Efficient Branching Policies of Integer Programs  🔍KLEE
arxiv.org·19h
aevyraai/verdict: Benchmark any LLM against your data. Pick the best model, then make it better.  🦙Ollama
github.com·5d·Hacker News
Efficient Ensemble Selection from Binary and Pairwise Feedback  🔍Miniselect
arxiv.org·19h
Chasing Small Sets Optimally Against Adaptive Adversaries  🔍Miniselect
arxiv.org·19h
KripkesBeard/programming-for-philosophers: Startings of a textbook which teaches declarative programming for applications in philosophy.  📊Datalog
github.com·3d·Hacker News
NSMQ Riddles: A Benchmark of Scientific and Mathematical Riddles for Quizzing Large Language Models  📝Parsing
arxiv.org·1d
PDEAgent-Bench: A Multi-Metric, Multi-Library Benchmark for PDE Solver Generation  🎭Program Synthesis
arxiv.org·19h
vera/FAQ.md at main  🦀Rust Macros
github.com·6d
MLS-Bench: A Holistic and Rigorous Assessment of AI Systems on Building Better AI  💬Prompt Engineering
arxiv.org·19h
MathlibPR: Pull Request Merge-Readiness Benchmark for Formal Mathematical Libraries  📊Criterion.rs
arxiv.org·1d
Near-Optimal Last-Iterate Convergence for Zero-Sum Games with Bandit Feedback and Opponent Actions  📊Dynamic Programming
arxiv.org·19h
Sign up or log in to see more results
Sign UpLogin

Keyboard Shortcuts

Navigation

Next / previous item
j/k
Open post
oorEnter
Preview post
v

Post Actions

Love post
a
Like post
l
Dislike post
d
Undo reaction
u
Save / unsave
s

Recommendations

Add interest / feed
Enter
Not interested
x

Go to

Home
gh
Interests
gi
Feeds
gf
Likes
gl
History
gy
Changelog
gc
Settings
gs
Browse
gb
Search
/

General

Show this help
?
Submit feedback
!
Close modal / unfocus
Esc

Press ? anytime to show this help