matt4711

5 ms·

1.
by matt4711 10d ago
I made the same choice. Also did not even consider the Blazer knowing they are identical.
2.
by matt4711 15d ago
You need ways to sift through large amounts of unstructured data and do data analysis after. We created these functions to be able to use LLMs to parse unstructured data from the into structured data which we then process with a SQL like en
3.
by matt4711 15d ago
Thanks for the feedback on the cancel/abort/edit requests. we are working on this already.
4.
by matt4711 15d ago
Hey, I'm on the team working on this. In terms of accuracy the best way to gauge the usefulness of these reports is to search for some you are deeply familiar with and then estimate. In general I find these reports have some gaps but f
5.
by matt4711 15d ago
Hey! I’m on the team working on this. The semantic web comparison is pretty close to how we think about this. One key difference is that we’re using LLMs to create structured data on the fly based on the query. That means we don't need
6.
by matt4711 20d ago
> Besides the clear AI smell, this nonsensical claim also plainly contradicts the methodology's key evaluation claim that the quality of an engine's results should be measured against how much it overlaps with the reranked agg
7.
by matt4711 20d ago
> Yeah? Care to cite anything for that? This automatically optimizing for clicks using ML is the main way google and other "human" focused search engines have been improving for 20 years. Not sure what citation is needed here.
8.
by matt4711 20d ago
The judgements are available on huggingface so training is possible. But given that we evaluate on new queries daily there would need to be some generalization happening for this to show up in the benchmark.
9.
by matt4711 20d ago
It is hard to be fair I agree. We tried to be open about what we do here: github.com/keenableai/needle The queries from what I can tell are not trivial. The actual github repo of the benchmark has a judgement/query browser wh
10.
by matt4711 20d ago
One of the authors here. We have been seeing lots of benchmaxxing and leakage in standard web search benchmarks such as BrowseComp. We developed this live benchmark with daily/hourly sampled fresh queries matching real agentic search t
11.
Needle: The benchmark your search engine can't memorize(keenable.ai)
33 points by matt4711 20d ago|12 comments
12.
by matt4711 22d ago
If you look at our benchmarks at https://keenableai.github.io/needle/ we are competitive in quality to exa (the market leader) but much cheaper and lower latency. This provides interesting tradeoffs where models can ca
13.
Show HN: Keenable – A different web search API for AI agents(keenable.ai)
12 points by matt4711 22d ago|5 comments
14.
by matt4711 1mo ago
I remember a couple of years ago Amazon added a new leadership principle: Success and Scale Bring Broad Responsibility We started in a garage, but we’re not there anymore. We are big, we impact the world, and we are far from perfect. We mus
15.
by matt4711 1mo ago
There will be new ways and incentives for content creators to be compensated. Many AI search startups are already talking about this or have created programs that help incentivize content creation.
16.
by matt4711 2y ago
A paper [1] we wrote in 2015 (cited by the authors) uses some more sophisticated data structures (compressed suffix trees) and Kneser–Ney smoothing to get the same "unlimited" context. I imagine with better smoothing and the same
17.
by matt4711 5y ago
LADWP (LA power provider) has a similar opt-in program for Nest owners with the following conditions: How the program works * We’ll adjust your connected thermostat(s) when summer electricity demand is at its highest to help decrease stress
18.
by matt4711 6y ago
I find the requirement of using a laptop without being allowed to use an external monitor to view potentially very long documents (half screen!) for hours on a tiny screen to be ridiculous.
19.
by matt4711 7y ago
Looking at the paper, comparing methods that use k bits per hash to a method that uses k*log(m) bits per hash seems unfair and misleading.
20.
by matt4711 8y ago
Funny enough "learning characters/words in the context of the vocabulary they are in" is exactly what NLP machine learning models use to learn "rich" word/text representations based on the "distribution hy
21.
by matt4711 8y ago
Like the requirement that you have to delete tweets in datasets that have been deleted on twitter?
22.
by matt4711 8y ago
I'm pretty sure all the twitter datasets violate the twitter TOCs.
23.
by matt4711 8y ago
From the first link: "Comparing OFDM to LTE today we find a better scalability to a much lower latency (an order of magnitude lower round-trip time [RTT] than LTE today) in OFDM." Doesn't LTE already have quite good latency p
24.
by matt4711 9y ago
Hetzner is involved in many of the non-related entity transfers.
25.
by matt4711 9y ago
I thought the NVIDIA drivers for the more fancy cards (TITAN etc) are the same as for the gforce cards. Wouldn't this restriction apply to those cards as well? Doesn't make much sense to me...
26.
by matt4711 9y ago
> I find it hard to believe this. Their main index is certainly not all-RAM (there must be some flash and maybe even disk), and the throughput would just not be enough for something like BitFunnel. From looking at the github repo it does
27.
by matt4711 9y ago
I was at the SIGIR'17 presentation of this paper (won best paper award btw) and have some comments in general: - They mentioned (from what I remember) that they now use BitFunnel as they core of the complete Bing search engine not just
28.
by matt4711 9y ago
Is there a binary version of this tool that can be downloaded somewhere? Seems a bit of a pain to install.
29.
by matt4711 9y ago
There are much faster SA construction algorithms than skew (check out divsufsort). The O(n) algorithms using induced sorting are also likely much faster than this work. The constants of recent O(n) algorithms are very low. here a link for s
30.
by matt4711 9y ago
I think china blocks zh.wikipedia.org but all other languages are not blocked.

More ›