Топ-10 конкурентов danielmiessler.com

lilianweng.github.io

[Updated on 2019-02-14: add ULMFiT and GPT-2.] [Updated on 2020-02-29: add ALBERT.] [Updated on 2020-10-25: add RoBERTa.] [Updated on 2020-12-13: add T5.] [Updated on 2020-12-30: add GPT-3.] [Updated on 2021-11-13: add XLNet, BART and ELECTRA; Also updated the Summary section.] I guess they are Elmo & Bert? (Image source: here) We have seen amazing progress in NLP in 2018. Large-scale pre-trained language modes like OpenAI GPT and BERT have achieved great performance on a variety of language tasks using generic model architectures. The idea is similar to how ImageNet classification pre-training helps many vision tasks (*). Even better than vision classification pre-training, this simple and powerful approach in NLP does not require labeled data for pre-training, allowing us to experiment with increased training scale, up to our very limit.

alignmentforum.org

A community blog devoted to technical AI alignment research

blog.samaltman.com

I get asked fairly often now by people in the US government what policy changes I would make to “fix innovation and drive economic growth” [1][2] (for some reason, it’s almost always that exact...

arxiv.org

We perform a behavioral experiment of karma, a class of mechanisms for repeated resource allocation with attractive fairness and efficiency properties, in theory. Individuals in these mechanisms bid non-tradable credits that flow from resource consumers to yielders, like karma. Human subjects recruited on Amazon MTurk are repeatedly and randomly paired to bid karma according to time-varying and stochastic individual preferences or urgency to acquire resources. Treatments varied in the dynamic urgency process (frequent moderate urgency versus sporadic high urgency) and the richness of the bidding scheme (binary versus full range). Results are benchmarked against random allocation, and karma achieves a (almost) Pareto improvement over random, despite the MTurk subjects deviating significantly from the theoretically optimal Nash bidding policy. Maximum improvement is attained by subjects that deviate from Nash by up to one karma bid unit on average, and positive improvement is attained with average deviations of up to 3-4 bid units. These findings hold across all treatments, among which no significant differences are found, with the exception of the sporadic high urgency process with binary bidding treatment being (weakly) favorable over others. These results offer behaviorally robust lower bounds for the expected performance of karma in human populations. They also provide guidance for future testing and implementation of karma mechanisms in the real world.

anthropic.com

Data on how software developers are using Claude

sites.research.google

Discover Google Research. We publish research papers across a wide range of domains and share our latest developments in AI and science research.

g42.ai

G42's Frontier AI Safety Framework

sourcely.net

Learn how to effectively export metadata across various formats to enhance research organization, sharing, and compliance.

promptperfect.jina.ai

Unlock prompt optimization for models like GPT-4, ChatGPT and Midjourney. Generate and refine prompts to perfection, receiving improved outcomes in seconds.