Not enough data to create a plot.
Try a different view from the menu above.
Thakur, Abhishek
AutoTrain: No-code training for state-of-the-art models
Thakur, Abhishek
With the advancements in open-source models, training (or finetuning) models on custom datasets has become a crucial part of developing solutions which are tailored to specific industrial or open-source applications. Yet, there is no single tool which simplifies the process of training across different types of modalities or tasks. We introduce AutoTrain (aka AutoTrain Advanced) -- an open-source, no code tool/library which can be used to train (or finetune) models for different kinds of tasks such as: large language model (LLM) finetuning, text classification/regression, token classification, sequence-to-sequence task, finetuning of sentence transformers, visual language model (VLM) finetuning, image classification/regression and even classification and regression tasks on tabular data. AutoTrain Advanced is an open-source library providing best practices for training models on custom datasets. The library is available at https://github.com/huggingface/autotrain-advanced. AutoTrain can be used in fully local mode or on cloud machines and works with tens of thousands of models shared on Hugging Face Hub and their variations.
RAFT: A Real-World Few-Shot Text Classification Benchmark
Alex, Neel, Lifland, Eli, Tunstall, Lewis, Thakur, Abhishek, Maham, Pegah, Riedel, C. Jess, Hine, Emmie, Ashurst, Carolyn, Sedille, Paul, Carlier, Alexis, Noetel, Michael, Stuhlmüller, Andreas
Large pre-trained language models have shown promise for few-shot learning, completing text-based tasks given only a few task-specific examples. Will models soon solve classification tasks that have so far been reserved for human research assistants? Existing benchmarks are not designed to measure progress in applied settings, and so don't directly answer this question. The RAFT benchmark (Real-world Annotated Few-shot Tasks) focuses on naturally occurring tasks and uses an evaluation setup that mirrors deployment. Baseline evaluations on RAFT reveal areas current techniques struggle with: reasoning over long texts and tasks with many classes. Human baselines show that some classification tasks are difficult for non-expert humans, reflecting that real-world value sometimes depends on domain expertise. Yet even non-expert human baseline F1 scores exceed GPT-3 by an average of 0.11. The RAFT datasets and leaderboard will track which model improvements translate into real-world benefits at https://raft.elicit.org .
NeBula: Quest for Robotic Autonomy in Challenging Environments; TEAM CoSTAR at the DARPA Subterranean Challenge
Agha, Ali, Otsu, Kyohei, Morrell, Benjamin, Fan, David D., Thakker, Rohan, Santamaria-Navarro, Angel, Kim, Sung-Kyun, Bouman, Amanda, Lei, Xianmei, Edlund, Jeffrey, Ginting, Muhammad Fadhil, Ebadi, Kamak, Anderson, Matthew, Pailevanian, Torkom, Terry, Edward, Wolf, Michael, Tagliabue, Andrea, Vaquero, Tiago Stegun, Palieri, Matteo, Tepsuporn, Scott, Chang, Yun, Kalantari, Arash, Chavez, Fernando, Lopez, Brett, Funabiki, Nobuhiro, Miles, Gregory, Touma, Thomas, Buscicchio, Alessandro, Tordesillas, Jesus, Alatur, Nikhilesh, Nash, Jeremy, Walsh, William, Jung, Sunggoo, Lee, Hanseob, Kanellakis, Christoforos, Mayo, John, Harper, Scott, Kaufmann, Marcel, Dixit, Anushri, Correa, Gustavo, Lee, Carlyn, Gao, Jay, Merewether, Gene, Maldonado-Contreras, Jairo, Salhotra, Gautam, Da Silva, Maira Saboia, Ramtoula, Benjamin, Fakoorian, Seyed, Hatteland, Alexander, Kim, Taeyeon, Bartlett, Tara, Stephens, Alex, Kim, Leon, Bergh, Chuck, Heiden, Eric, Lew, Thomas, Cauligi, Abhishek, Heywood, Tristan, Kramer, Andrew, Leopold, Henry A., Choi, Chris, Daftry, Shreyansh, Toupet, Olivier, Wee, Inhwan, Thakur, Abhishek, Feras, Micah, Beltrame, Giovanni, Nikolakopoulos, George, Shim, David, Carlone, Luca, Burdick, Joel
This paper presents and discusses algorithms, hardware, and software architecture developed by the TEAM CoSTAR (Collaborative SubTerranean Autonomous Robots), competing in the DARPA Subterranean Challenge. Specifically, it presents the techniques utilized within the Tunnel (2019) and Urban (2020) competitions, where CoSTAR achieved 2nd and 1st place, respectively. We also discuss CoSTAR's demonstrations in Martian-analog surface and subsurface (lava tubes) exploration. The paper introduces our autonomy solution, referred to as NeBula (Networked Belief-aware Perceptual Autonomy). NeBula is an uncertainty-aware framework that aims at enabling resilient and modular autonomy solutions by performing reasoning and decision making in the belief space (space of probability distributions over the robot and world states). We discuss various components of the NeBula framework, including: (i) geometric and semantic environment mapping; (ii) a multi-modal positioning system; (iii) traversability analysis and local planning; (iv) global motion planning and exploration behavior; (i) risk-aware mission planning; (vi) networking and decentralized reasoning; and (vii) learning-enabled adaptation. We discuss the performance of NeBula on several robot types (e.g. wheeled, legged, flying), in various environments. We discuss the specific results and lessons learned from fielding this solution in the challenging courses of the DARPA Subterranean Challenge competition.
AutoCompete: A Framework for Machine Learning Competition
Thakur, Abhishek, Krohn-Grimberghe, Artus
In this paper, we propose AutoCompete, a highly automated machine learning framework for tackling machine learning competitions. This framework has been learned by us, validated and improved over a period of more than two years by participating in online machine learning competitions. It aims at minimizing human interference required to build a first useful predictive model and to assess the practical difficulty of a given machine learning challenge. The proposed system helps in identifying data types, choosing a machine learn- ing model, tuning hyper-parameters, avoiding over-fitting and optimization for a provided evaluation metric. We also observe that the proposed system produces better (or comparable) results with less runtime as compared to other approaches.