22,469 research outputs found

    H-TSP: Hierarchically Solving the Large-Scale Travelling Salesman Problem

    Full text link
    We propose an end-to-end learning framework based on hierarchical reinforcement learning, called H-TSP, for addressing the large-scale Travelling Salesman Problem (TSP). The proposed H-TSP constructs a solution of a TSP instance starting from the scratch relying on two components: the upper-level policy chooses a small subset of nodes (up to 200 in our experiment) from all nodes that are to be traversed, while the lower-level policy takes the chosen nodes as input and outputs a tour connecting them to the existing partial route (initially only containing the depot). After jointly training the upper-level and lower-level policies, our approach can directly generate solutions for the given TSP instances without relying on any time-consuming search procedures. To demonstrate effectiveness of the proposed approach, we have conducted extensive experiments on randomly generated TSP instances with different numbers of nodes. We show that H-TSP can achieve comparable results (gap 3.42% vs. 7.32%) as SOTA search-based approaches, and more importantly, we reduce the time consumption up to two orders of magnitude (3.32s vs. 395.85s). To the best of our knowledge, H-TSP is the first end-to-end deep reinforcement learning approach that can scale to TSP instances of up to 10000 nodes. Although there are still gaps to SOTA results with respect to solution quality, we believe that H-TSP will be useful for practical applications, particularly those that are time-sensitive e.g., on-call routing and ride hailing service.Comment: Accepted by AAAI 2023, February 202

    Decentralized projected Riemannian gradient method for smooth optimization on compact submanifolds

    Full text link
    We consider the problem of decentralized nonconvex optimization over a compact submanifold, where each local agent's objective function defined by the local dataset is smooth. Leveraging the powerful tool of proximal smoothness, we establish local linear convergence of the projected gradient descent method with unit step size for solving the consensus problem over the compact manifold. This serves as the basis for analyzing decentralized algorithms on manifolds. Then, we propose two decentralized methods, namely the decentralized projected Riemannian gradient descent (DPRGD) and the decentralized projected Riemannian gradient tracking (DPRGT) methods. We establish their convergence rates of O(1/K)\mathcal{O}(1/\sqrt{K}) and O(1/K)\mathcal{O}(1/K), respectively, to reach a stationary point. To the best of our knowledge, DPRGT is the first decentralized algorithm to achieve exact convergence for solving decentralized optimization over a compact manifold. The key ingredients in the proof are the Lipschitz-type inequalities of the projection operator on the compact manifold and smooth functions on the manifold, which could be of independent interest. Finally, we demonstrate the effectiveness of our proposed methods compared to state-of-the-art ones through numerical experiments on eigenvalue problems and low-rank matrix completion.Comment: 32 page

    The Metaverse: Survey, Trends, Novel Pipeline Ecosystem & Future Directions

    Full text link
    The Metaverse offers a second world beyond reality, where boundaries are non-existent, and possibilities are endless through engagement and immersive experiences using the virtual reality (VR) technology. Many disciplines can benefit from the advancement of the Metaverse when accurately developed, including the fields of technology, gaming, education, art, and culture. Nevertheless, developing the Metaverse environment to its full potential is an ambiguous task that needs proper guidance and directions. Existing surveys on the Metaverse focus only on a specific aspect and discipline of the Metaverse and lack a holistic view of the entire process. To this end, a more holistic, multi-disciplinary, in-depth, and academic and industry-oriented review is required to provide a thorough study of the Metaverse development pipeline. To address these issues, we present in this survey a novel multi-layered pipeline ecosystem composed of (1) the Metaverse computing, networking, communications and hardware infrastructure, (2) environment digitization, and (3) user interactions. For every layer, we discuss the components that detail the steps of its development. Also, for each of these components, we examine the impact of a set of enabling technologies and empowering domains (e.g., Artificial Intelligence, Security & Privacy, Blockchain, Business, Ethics, and Social) on its advancement. In addition, we explain the importance of these technologies to support decentralization, interoperability, user experiences, interactions, and monetization. Our presented study highlights the existing challenges for each component, followed by research directions and potential solutions. To the best of our knowledge, this survey is the most comprehensive and allows users, scholars, and entrepreneurs to get an in-depth understanding of the Metaverse ecosystem to find their opportunities and potentials for contribution

    Startup Home-Based Social Media Businesses

    Get PDF
    Purpose: The objective of this study is to investigate and analyze issues faced by small-business owners while running their businesses via social media sites, and to emphasize the opportunities for conducting business via social media.   Theoretical framework:  Small businesses are vital to the success of any economy, through job creation, sparking innovation, and providing opportunities for many people to achieve financial success and independence. In today’s social media-driven environment, it is essential that small business’ owners engage with social media networking sites and understand how social media can play a crucial role in developing their businesses.   Design/methodology/approach: The research focuses on analyzing the day-to-day operations and procedures of small businesses involving social media networking sites. Two questionnaires were developed to analyze and investigate these issues effectively.   Findings:  The results reveal the importance of organizing the operations and procedures of social media businesses, also emphasize the opportunities for conducting business via social media sites.   Research, Practical & Social implications:  this study was conducted to help business owners to engage with social media sites, as well as to solve issues that they face while running their online businesses.   Originality/value: The results of the first questionnaire indicate issues from customers’ perspectives, while the second questionnaire indicate issues from merchants’ perspectives. The results reveal the importance of organizing the operations and procedures of social media businesses, also emphasize the opportunities for conducting business via social media sites

    Manipulating Federated Recommender Systems: Poisoning with Synthetic Users and Its Countermeasures

    Full text link
    Federated Recommender Systems (FedRecs) are considered privacy-preserving techniques to collaboratively learn a recommendation model without sharing user data. Since all participants can directly influence the systems by uploading gradients, FedRecs are vulnerable to poisoning attacks of malicious clients. However, most existing poisoning attacks on FedRecs are either based on some prior knowledge or with less effectiveness. To reveal the real vulnerability of FedRecs, in this paper, we present a new poisoning attack method to manipulate target items' ranks and exposure rates effectively in the top-KK recommendation without relying on any prior knowledge. Specifically, our attack manipulates target items' exposure rate by a group of synthetic malicious users who upload poisoned gradients considering target items' alternative products. We conduct extensive experiments with two widely used FedRecs (Fed-NCF and Fed-LightGCN) on two real-world recommendation datasets. The experimental results show that our attack can significantly improve the exposure rate of unpopular target items with extremely fewer malicious users and fewer global epochs than state-of-the-art attacks. In addition to disclosing the security hole, we design a novel countermeasure for poisoning attacks on FedRecs. Specifically, we propose a hierarchical gradient clipping with sparsified updating to defend against existing poisoning attacks. The empirical results demonstrate that the proposed defending mechanism improves the robustness of FedRecs.Comment: This paper has been accepted by SIGIR202

    One Small Step for Generative AI, One Giant Leap for AGI: A Complete Survey on ChatGPT in AIGC Era

    Full text link
    OpenAI has recently released GPT-4 (a.k.a. ChatGPT plus), which is demonstrated to be one small step for generative AI (GAI), but one giant leap for artificial general intelligence (AGI). Since its official release in November 2022, ChatGPT has quickly attracted numerous users with extensive media coverage. Such unprecedented attention has also motivated numerous researchers to investigate ChatGPT from various aspects. According to Google scholar, there are more than 500 articles with ChatGPT in their titles or mentioning it in their abstracts. Considering this, a review is urgently needed, and our work fills this gap. Overall, this work is the first to survey ChatGPT with a comprehensive review of its underlying technology, applications, and challenges. Moreover, we present an outlook on how ChatGPT might evolve to realize general-purpose AIGC (a.k.a. AI-generated content), which will be a significant milestone for the development of AGI.Comment: A Survey on ChatGPT and GPT-4, 29 pages. Feedback is appreciated ([email protected]

    PrivLava: Synthesizing Relational Data with Foreign Keys under Differential Privacy

    Full text link
    Answering database queries while preserving privacy is an important problem that has attracted considerable research attention in recent years. A canonical approach to this problem is to use synthetic data. That is, we replace the input database R with a synthetic database R* that preserves the characteristics of R, and use R* to answer queries. Existing solutions for relational data synthesis, however, either fail to provide strong privacy protection, or assume that R contains a single relation. In addition, it is challenging to extend the existing single-relation solutions to the case of multiple relations, because they are unable to model the complex correlations induced by the foreign keys. Therefore, multi-relational data synthesis with strong privacy guarantees is an open problem. In this paper, we address the above open problem by proposing PrivLava, the first solution for synthesizing relational data with foreign keys under differential privacy, a rigorous privacy framework widely adopted in both academia and industry. The key idea of PrivLava is to model the data distribution in R using graphical models, with latent variables included to capture the inter-relational correlations caused by foreign keys. We show that PrivLava supports arbitrary foreign key references that form a directed acyclic graph, and is able to tackle the common case when R contains a mixture of public and private relations. Extensive experiments on census data sets and the TPC-H benchmark demonstrate that PrivLava significantly outperforms its competitors in terms of the accuracy of aggregate queries processed on the synthetic data.Comment: This is an extended version of a SIGMOD 2023 pape

    Treatment of fractured concrete via microbially induced carbonate precipitation : from micro-scale characteristics to macro-scale behaviour

    Get PDF
    The development of techniques for concrete repair will reduce environmental impacts associated with concrete usage by extending the lifespan of existing structures. This study investigates microbially induced carbonate precipitation (MICP) for treating fractured concrete. Our results demonstrate the excellent penetrability of MICP with precipitates well-distributed along core length. Some individual treatment cycles resulted in ~one order of magnitude reduction in core permeability. Treatment efficiency is shown to be dependent on fracture network characteristics, i.e. number of fractures, fracture orientation, initial hydraulic aperture. Furthermore, bridging of precipitates across fracture surfaces resulted in a recovery of 26-50% of initial tensile strength

    Antenna Arrangement in UWB Helmet Brain Applicators for Deep Microwave Hyperthermia

    Get PDF
    Deep microwave hyperthermia applicators are typically designed as narrow-band conformal antenna arrays with equally spaced elements, arranged in one or more rings. This solution, while adequate for most body regions, might be sub-optimal for brain treatments. The introduction of ultra-wide-band semi-spherical applicators, with elements arranged around the head and not necessarily aligned, has the potential to enhance the selective thermal dose delivery in this challenging anatomical region. However, the additional degrees of freedom in this design make the problem non-trivial. We address this by treating the antenna arrangement as a global SAR-based optimization process aiming at maximizing target coverage and hot-spot suppression in a given patient. To enable the quick evaluation of a certain arrangement, we propose a novel E-field interpolation technique which calculates the field generated by an antenna at any location around the scalp from a limited number of initial simulations. We evaluate the approximation error against full array simulations. We demonstrate the design technique in the optimization of a helmet applicator for the treatment of a medulloblastoma in a paediatric patient. The optimized applicator achieves 0.3\ua0 (Formula presented.) C higher T90 than a conventional ring applicator with the same number of elements
    • …
    corecore