Goto

Collaborating Authors

 Overview


The Role of Digital Agriculture in Transforming Rural Areas into Smart Villages

arXiv.org Artificial Intelligence

From the perspective of any nation, rural areas generally present a comparable set of problems, such as a lack of proper health care, education, living conditions, wages, and market opportunities. Some nations have created and developed the concept of smart villages during the previous few decades, which effectively addresses these issues. The landscape of traditional agriculture has been radically altered by digital agriculture, which has also had a positive economic impact on farmers and those who live in rural regions by ensuring an increase in agricultural production. We explored current issues in rural areas, and the consequences of smart village applications, and then illustrate our concept of smart village from recent examples of how emerging digital agriculture trends contribute to improving agricultural production in this chapter.


What Is The Best Artificial Intelligence App? - Dataconomy

#artificialintelligence

What is the best artificial intelligence app, and what does it offer? Artificial Intelligence (AI) is one of the most well-known and renowned technologies of our time. It enables machines and applications to accomplish tasks more effectively and accurately than ever before. This game-changing technology may automate procedures, tackle complex data issues, speed up processes, and make your previous systems smarter. Don't be scared of AI jargon; we've created a detailed AI glossary for the most commonly used Artificial Intelligence terms.


Maximizing Object Detection Accuracy with FPN: A Comprehensive Overview

#artificialintelligence

FPN (Feature Pyramid Network) is a type of convolutional neural network architecture for object detection tasks. It is designed to improve the performance of object detection models by making use of both high-level and low-level features from the input image. The basic idea behind FPN is to build a pyramid of features, where each level in the pyramid represents a different scale or resolution of the input image. The top of the pyramid represents the high-level, semantically rich features, while the bottom of the pyramid represents the low-level, fine-grained features. By combining features from different levels in the pyramid, the model is able to make use of both the semantically rich high-level features and the fine-grained low-level features to improve the accuracy of object detection.


Fast Contact-Implicit Model-Predictive Control

arXiv.org Artificial Intelligence

We present a general approach for controlling robotic systems that make and break contact with their environments. Contact-implicit model predictive control (CI-MPC) generalizes linear MPC to contact-rich settings by utilizing a bi-level planning formulation with lower-level contact dynamics formulated as time-varying linear complementarity problems (LCPs) computed using strategic Taylor approximations about a reference trajectory. These dynamics enable the upper-level planning problem to reason about contact timing and forces, and generate entirely new contact-mode sequences online. To achieve reliable and fast numerical convergence, we devise a structure-exploiting interior-point solver for these LCP contact dynamics and a custom trajectory optimizer for the tracking problem. We demonstrate real-time solution rates for CI-MPC and the ability to generate and track non-periodic behaviours in hardware experiments on a quadrupedal robot. We also show that the controller is robust to model mismatch and can respond to disturbances by discovering and exploiting new contact modes across a variety of robotic systems in simulation, including a pushbot, planar hopper, planar quadruped, and planar biped.


Source-Free Unsupervised Domain Adaptation: A Survey

arXiv.org Artificial Intelligence

Unsupervised domain adaptation (UDA) via deep learning has attracted appealing attention for tackling domain-shift problems caused by distribution discrepancy across different domains. Existing UDA approaches highly depend on the accessibility of source domain data, which is usually limited in practical scenarios due to privacy protection, data storage and transmission cost, and computation burden. To tackle this issue, many source-free unsupervised domain adaptation (SFUDA) methods have been proposed recently, which perform knowledge transfer from a pre-trained source model to unlabeled target domain with source data inaccessible. A comprehensive review of these works on SFUDA is of great significance. In this paper, we provide a timely and systematic literature review of existing SFUDA approaches from a technical perspective. Specifically, we categorize current SFUDA studies into two groups, i.e., white-box SFUDA and black-box SFUDA, and further divide them into finer subcategories based on different learning strategies they use. We also investigate the challenges of methods in each subcategory, discuss the advantages/disadvantages of white-box and black-box SFUDA methods, conclude the commonly used benchmark datasets, and summarize the popular techniques for improved generalizability of models learned without using source data. We finally discuss several promising future directions in this field.


Systems for Parallel and Distributed Large-Model Deep Learning Training

arXiv.org Artificial Intelligence

Deep learning (DL) has transformed applications in a variety of domains, including computer vision, natural language processing, and tabular data analysis. The search for improved DL model accuracy has led practitioners to explore increasingly large neural architectures, with some recent Transformer models spanning hundreds of billions of learnable parameters. These designs have introduced new scale-driven systems challenges for the DL space, such as memory bottlenecks, poor runtime efficiency, and high costs of model development. Efforts to address these issues have explored techniques such as parallelization of neural architectures, spilling data across the memory hierarchy, and memory-efficient data representations. This survey will explore the large-model training systems landscape, highlighting key challenges and the various techniques that have been used to address them.


A Survey on Understanding and Representing Privacy Requirements in the Internet-of-Things

Journal of Artificial Intelligence Research

People are interacting with online systems all the time. In order to use the services being provided, they give consent for their data to be collected. This approach requires too much human effort and is impractical for systems like Internet-of-Things (IoT) where human-device interactions can be large. Ideally, privacy assistants can help humans make privacy decisions while working in collaboration with them. In our work, we focus on the identification and representation of privacy requirements in IoT to help privacy assistants better understand their environment. In recent years, more focus has been on the technical aspects of privacy. However, the dynamic nature of privacy also requires a representation of social aspects (e.g., social trust). In this survey paper, we review the privacy requirements represented in existing IoT ontologies. We discuss how to extend these ontologies with new requirements to better capture privacy, and we introduce case studies to demonstrate the applicability of the novel requirements.


Can Large Language Models Change User Preference Adversarially?

arXiv.org Artificial Intelligence

As pretrained large language models become larger in size and capabilities, it becomes increasingly important to ensure safety in their role in society and deployment in high-stakes situations. For instance, ChatGPT is a preview of the future of personal dialogue assistants and interpreting and explaining such models has become critical towards minimizing undesirable downstream consequences. Language models as personal dialogue assistants, by virtue of engaging in conversation with the user, have the ability to influence, persuade or potentially manipulate the user in adversarial settings. Franklin et al. [2022] argue for a framework to address the lack of formalism in the study of user preference and behavioral change due to these models. While adversarial change in user preferences has been studied for recommender systems Adomavicius et al. [2013], it has largely been unexplored from the lens of dialogue assistants and large language models.


A Survey of Code-switching: Linguistic and Social Perspectives for Language Technologies

arXiv.org Artificial Intelligence

The analysis of data in which multiple languages are represented has gained popularity among computational linguists in recent years. So far, much of this research focuses mainly on the improvement of computational methods and largely ignores linguistic and social aspects of C-S discussed across a wide range of languages within the long-established literature in linguistics. To fill this gap, we offer a survey of code-switching (C-S) covering the literature in linguistics with a reflection on the key issues in language technologies. From the linguistic perspective, we provide an overview of structural and functional patterns of C-S focusing on the literature from European and Indian contexts as highly multilingual areas. From the language technologies perspective, we discuss how massive language models fail to represent diverse C-S types due to lack of appropriate training data, lack of robust evaluation benchmarks for C-S (across multilingual situations and types of C-S) and lack of end-to-end systems that cover sociolinguistic aspects of C-S as well. Our survey will be a step towards an outcome of mutual benefit for computational scientists and linguists with a shared interest in multilingualism and C-S.


Multifidelity Modeling for Physics-Informed Neural Networks (PINNs)

arXiv.org Artificial Intelligence

Multifidelity simulation methodologies are often used in an attempt to judiciously combine low-fidelity and high-fidelity simulation results in an accuracy-increasing, cost-saving way. Candidates for this approach are simulation methodologies for which there are fidelity differences connected with significant computational cost differences. Physics-informed Neural Networks (PINNs) are candidates for these types of approaches due to the significant difference in training times required when different fidelities (expressed in terms of architecture width and depth as well as optimization criteria) are employed. In this paper, we propose a particular multifidelity approach applied to PINNs that exploits low-rank structure. We demonstrate that width, depth, and optimization criteria can be used as parameters related to model fidelity, and show numerical justification of cost differences in training due to fidelity parameter choices. We test our multifidelity scheme on various canonical forward PDE models that have been presented in the emerging PINNs literature.