中文 English Français Русский Español العربية

Show HN: Better search of public data, strategystudio.org

Hacker News Show2026-10-21 05:560 views

I got tired of public data being silo'd or difficult to search or aggregate. LLM's could only handle so much and slowly. So I built a free site and loaded lots in. Know of any other data to pour in, LMK.

Comments URL: https://news.ycombinator.com/item?id=50173235

Points: 1

# Comments: 0

Source：https://strategystudio.org/

My favorites

PreviousShow HN: Axon – Obsidian plugin that finds the todos buried in your notes NextShow HN: Flyte devbox now runs GPU workloads on Apple Silicon

$Sharp Non-Asymptotic Analysis of the Penalized Challenger in $\beta$-EB-TCI for Bernoulli Bandits$

Sharp Non-Asymptotic Analysis of the Penalized Challenger in $\beta$-EB-TCI for Bernoulli Bandits

arXiv:2610.01951v2 Announce Type: replace-cross Abstract: Top-two algorithms are simple and effective for fixed-confiden

0arXiv stat.ML

Toward Optimal Switching Regret for Multi-Armed Bandits with Oblivious Adversary

arXiv:2609.13547v2 Announce Type: replace-cross Abstract: We study switching regret in adversarial multi-armed bandits,

0arXiv stat.ML

$Spectral Condition for $\mu$P under Width-Depth Scaling$

Spectral Condition for $\mu$P under Width-Depth Scaling

arXiv:2603.00541v3 Announce Type: replace-cross Abstract: Generative foundation models are increasingly scaled in both w

0arXiv stat.ML

A Function-Space Stability Boundary for Generalization in Interpolating Learning Systems

arXiv:2602.03514v3 Announce Type: replace-cross Abstract: Modern learning systems often interpolate training data while

0arXiv stat.ML

Who Gets Watched? Allocating Scarce Escalation Resources on Pediatric Wards with Neural Index Policies

arXiv:2510.22069v2 Announce Type: replace-cross Abstract: Problem definition: Hospitals use separate pathways to identif

0arXiv stat.ML

Minimax Alternating Regret for the Experts Problem and Online Convex Optimization

arXiv:2608.25182v2 Announce Type: replace Abstract: In this paper, we study alternating regret in online convex optimiza

0arXiv stat.ML

Show HN: Better search of public data, strategystudio.org

Related posts

Sharp Non-Asymptotic Analysis of the Penalized Challenger in $\beta$-EB-TCI for Bernoulli Bandits

Toward Optimal Switching Regret for Multi-Armed Bandits with Oblivious Adversary

Spectral Condition for $\mu$P under Width-Depth Scaling

A Function-Space Stability Boundary for Generalization in Interpolating Learning Systems

Who Gets Watched? Allocating Scarce Escalation Resources on Pediatric Wards with Neural Index Policies

Minimax Alternating Regret for the Experts Problem and Online Convex Optimization