The following are terms of a legal agreement between you and Orbifold Consulting. By accessing, browsing and/or using this web site, you acknowledge that you have read, understood, and agree, to be bound by these terms and to comply with all applicable laws and regulations. If you do not agree to these terms, do not use this web site.
Information on this Web site may contain technical inaccuracies or typographical errors. Information may be changed or updated without notice. Orbifold Consulting may also make improvements and/or changes in the products and/or the programs described in this information at any time without notice.
Orbifold Consulting assumes no responsibility regarding the accuracy of the information that is provided and use of such information is at the recipient’s own risk. Orbifold Consulting provides no assurances that any reported problems may be resolved with the use of any information that Orbifold Consulting provides.
Orbifold Consulting does not want to receive confidential or proprietary information from you through our Web site. Please note that any information or material sent to Orbifold Consulting will be deemed NOT to be confidential. By sending Orbifold Consulting any information or material, you grant Orbifold Consulting an unrestricted, irrevocable license to use, reproduce, display, perform, modify, transmit and distribute those materials or information, and you also agree that Orbifold Consulting Tis free to use any ideas, concepts, know-how or techniques that you send us for any purpose. However, we will not release your name or otherwise publicize the fact that you submitted materials or other information to us unless: (a) we obtain your permission to use your name; or (b) we first notify you that the materials or other information you submit to a particular part of this site will be published or otherwise used with your name on it; or (c) we are required to do so by law.
Orbifold Consulting makes no representations whatsoever about any other Web site which you may access through this one. When you access a non-Orbifold Web site, even one that may contain Orbifold Consulting-logo, please understand that it is independent from Orbifold Consulting, and that Orbifold Consulting has no control over the content on that Web site. In addition, a link to a non-Orbifold Web site does not mean that Orbifold Consulting endorses or accepts any responsibility for the content, or the use, of such Web site. It is up to you to take precautions to ensure that whatever you select for your use is free of such items as viruses, worms, trojan horses and other items of a destructive nature.
IN NO EVENT WILL Orbifold Consulting BE LIABLE TO ANY PARTY FOR ANY DIRECT, INDIRECT, SPECIAL OR OTHER CONSEQUENTIAL DAMAGES FOR ANY USE OF THIS WEB SITE, OR ON ANY OTHER HYPER LINKED WEB SITE, INCLUDING, WITHOUT LIMITATION, ANY LOST PROFITS, BUSINESS INTERRUPTION, LOSS OF PROGRAMS OR OTHER DATA ON YOUR INFORMATION HANDLING SYSTEM OR OTHERWISE, EVEN IF WE ARE EXPRESSLY ADVISED OF THE POSSIBILITY OF SUCH DAMAGES.
ALL INFORMATION IS PROVIDED BY Orbifold Consulting ON AN “AS IS” BASIS ONLY. Orbifold Consulting PROVIDES NO REPRESENTATIONS AND WARRANTIES, EXPRESS OR IMPLIED, INCLUDING THE IMPLIED WARRANTIES OF FITNESS FOR A PARTICULAR PURPOSE, MERCHANTABILITY AND NONINFRINGEMENT.
Orbifold Consulting may at any time revise these terms by updating this posting. By using this web site, you agree to be bound by any such revisions and should therefore periodically visit this page to determine the then current terms to which you are bound.
📝 Paper: https://t.co/NuUG7HDOGZ
🤖 Model & Code: https://t.co/52vzfsh1WS
🌐 Website: https://t.co/HR3C9Spb4x https://t.co/s1NDNWE8J9
- Significantly better samples (better FID scores & reduced artifacts)
- No more progressive growing
- Improved Style-mixing
- Smoother interpolations (extra regularization)
- Faster training
Github: https://t.co/kw6X8NvjXC https://t.co/5Cnlg9j91V
ALBERT is released alongside CamemBERT, implemented by the authors, DistilRoBERTa (twice as fast as RoBERTa-base!) and GPT-2 XL!
Encoder-decoder with ⭐Model2Model⭐
Available on https://t.co/rNsF2qEV2C https://t.co/r6M39jYPHf
To learn more, read the post by @tylerzhu3, @oveddan, @greenbeandou, @dsmilkov, @karlssonper, @ire_alva, @nsthorat.
Details here → https://t.co/Zq8dwiNO5A https://t.co/a4qKJu9EJ1
Enter a block of text to see if the detector thinks it's human-written...or a GPT-2 forgery.
✅ in the transformers repo: https://t.co/KvUK5V7owl
✅ try it out live in Write With Transformer🦄 https://t.co/R0WHn2WMQt
🔘 Detector model based on RoBERTa
Thanks @OpenAI @Miles_Brundage @jackclarkSF and all
Accessible from anywhere. https://t.co/K3nRELshX8 https://t.co/PG0ddyJxQx
networks. https://t.co/g6XHsZ74Ba #GraphLearning #SemanticAI https://t.co/sRdYr9jj2T
@stellargraph_io, graph layout using yEd Live by
@yworks. #AI #graphs #GraphLearning https://t.co/tkrq9w9gPl https://t.co/B2D9HPOCqA
A managed TensorBoard experience that lets you upload and share your ML experiment results with anyone. https://t.co/HTXshj5wDL https://t.co/KO9suezIJW
🧮 Multiprocessing in nlp.pipe
⏳ Simpler GPU install and setup
💬 Base support for Luxembourgish and model fixes
🔮 Forwards-compatible support for future APIs
with first-class Scala support. https://t.co/D6BLJ25p5w #scalalang #MachineLearning https://t.co/JipxCKYaG6
- Artificial Intelligence (92)
- Big Data (18)
- Data Science (93)
- Diverse (4)
- Quantum Computing (36)