Miracle-dz/UniFAR-FTUs huggingface dataset:
Competitive Influence Propagation and Fake News Mitigation in the Presence of Strong User Bias

Due to the extensive role of social networks in social media, it is easy for people to share the news, and it spreads faster than ever before. These platforms also have been exploited to share the rumor or fake information, which is a threat to society. One method to reduce the impact of fake information is making people aware of the correct information based on hard proof. In this work, first, we propose a propagation model called Competitive Independent Cascade Model with users' Bias (CICMB) that considers the presence of strong user bias towards different opinions, believes, or political parties. We further propose a method, called $k-TruthScore$, to identify an optimal set of truth campaigners from a given set of prospective truth campaigners to minimize the influence of rumor spreaders on the network. We compare $k-TruthScore$ with state of the art methods, and we measure their performances as the percentage of the saved nodes (nodes that would have believed in the fake news in the absence of the truth campaigners). We present these results on a few real-world networks, and the results show that $k-TruthScore$ method outperforms baseline methods.
Neural Latent Dependency Model for Sequence Labeling

Sequence labeling is a fundamental problem in machine learning, natural language processing and many other fields. A classic approach to sequence labeling is linear chain conditional random fields (CRFs). When combined with neural network encoders, they achieve very good performance in many sequence labeling tasks. One limitation of linear chain CRFs is their inability to model long-range dependencies between labels. High order CRFs extend linear chain CRFs by modeling dependencies no longer than their order, but the computational complexity grows exponentially in the order. In this paper, we propose the Neural Latent Dependency Model (NLDM) that models dependencies of arbitrary length between labels with a latent tree structure. We develop an end-to-end training algorithm and a polynomial-time inference algorithm of our model. We evaluate our model on both synthetic and real datasets and show that our model outperforms strong baselines.
Protected quantum correlations in multiple non-Markovian system-reservoir dynamics.

Based on tensor network realizations of path integrals reducing exponential memory scaling to polynomial efficiency, we investigate a quantum system simultaneously exposed to two structured reservoirs. For this purpose, we employ a quasi-2D tensor network combining both diagonal and off-diagonal system-reservoir interactions with a twofold memory for continuous and discrete retardation effects. As a possible example, we study the non-Markovian dynamical interplay between discrete photonic feedback and structured acoustic phonon modes, resulting in long-living population trapping within an initially-excited two-level system and allowing for an interfering memory-induced stable dissipative structure.
Tokoin: A Coin-Based Accountable Access Control Scheme for Internet of Things

With the prevalence of Internet of Things (IoT) applications, IoT devices interact closely with our surrounding environments, bringing us unparalleled smartness and convenience. However, the development of secure IoT solutions is getting a long way lagged behind, making us exposed to common unauthorized accesses that may bring malicious attacks and unprecedented danger to our daily life. Overprivilege attack, a widely reported phenomenon in IoT that accesses unauthorized or excessive resources, is notoriously hard to prevent, trace and mitigate. To tackle this challenge, we propose Tokoin-Based Access Control (TBAC), an accountable access control model enabled by blockchain and Trusted Execution Environment (TEE) technologies, to offer fine-graininess, strong auditability, and access procedure control for IoT. TBAC materializes the virtual access power into a definite-amount and secure cryptographic coin termed "tokoin" (token+coin), and manages it using atomic and accountable state-transition functions in a blockchain. We also realize access procedure control by mandating every tokoin a fine-grained access policy defining who is allowed to do what at when in where by how. The tokoin is peer-to-peer transferable, and can be modified only by the resource owner when necessary. We fully implement TBAC with well-studied cryptographic primitives and blockchain platforms and present a readily available APP for regular users. We also present a case study to demonstrate how TBAC is employed to enable autonomous in-home cargo delivery while guaranteeing the access policy compliance and home owner's physical security by regulating the physical behaviors of the deliveryman.
Evolving Nano Particle Cancer Treatments with Multiple Particle Types

Evolutionary algorithms have long been used for optimization problems where the appropriate size of solutions is unclear a priori. The applicability of this methodology is here investigated on the problem of designing a nano-particle (NP) based drug delivery system targeting cancer tumours. Utilizing a treatment comprising of multiple types of NPs is expected to be more effective due to the higher complexity of the treatment. This paper begins by utilizing the well-known NK model to explore the effects of fitness landscape ruggedness upon the evolution of genome length and, hence, solution complexity. The size of a novel sequence and the absence or presence of sequence deletion are also considered. Results show that whilst landscape ruggedness can alter the dynamics of the process, it does not hinder the evolution of genome length. These findings are then explored within the aforementioned real-world problem. In the first known instance, treatments with multiple types of NPs are used simultaneously, via an agent-based open source physics-based cell simulator. The results suggest that utilizing multiple types of NPs is more efficient when the solution space is explored with the evolutionary techniques under a predefined computational budget.
An End-to-End Differentiable but Explainable Physics Engine for Tensegrity Robots: Modeling and Control

This work proposes an end-to-end differentiable physics engine for tensegrity robots, which introduces a data-efficient linear contact model for accurately predicting collision responses that arise due to contacting surfaces, and a linear actuator model that can drive these robots by expanding and contracting their flexible cables. To the best of the authors' knowledge, this is the \emph{first} differentiable physics engine for tensegrity robots that supports cable modeling, contact, and actuation. This engine can be used inside an off-the-shelf, RL-based locomotion controller in order to provide training examples. This paper proposes a progressive training pipeline for the differentiable physics engine that helps avoid local optima during the training phase and reduces data requirements. It demonstrates the data-efficiency benefits of using the differentiable engine for learning locomotion policies for NASA's icosahedron SUPERballBot. In particular, after the engine has been trained with few trajectories to match a ground truth simulated model, then a policy learned on the differentiable engine is shown to be transferable back to the ground-truth model. Training the controller requires orders of magnitude more data than training the differential engine.
Model Predictive Control for Human-Centred Lower Limb Robotic Assistance

Loss of mobility and/or balance resulting from neural trauma is a critical public health issue. Robotic exoskeletons hold great potential for rehabilitation and assisted movement. However, the synergy of robot operation with human effort remains a problem. In particular, optimal assist-as-needed (AAN) control remains unresolved given pathological variance among patients. We introduce a model predictive control (MPC) architecture for lower limb exoskeletons that achieves on-the-fly transitions between modes of assistance. The architecture implements a fuzzy logic algorithm (FLA) to map key modes of assistance based on human involvement. Three modes are utilised: passive, for human relaxed and robot dominant; active-assist, for human cooperation with the task; and safety, in the case of human resistance to the robot. Electromyography (EMG) signals are further employed to predict the human torque. EMG output is used by the MPC for trajectory following and by the FLA for decision making. Experimental validation using a 1-DOF knee exoskeleton demonstrates the controller tracking a sinusoidal trajectory with relaxed, assistive, and resistive operational modes. Results demonstrate rapid and appropriate transfers among the assistance modes, and satisfactory AAN performance in each case, offering a new level of human-robot synergy for mobility assist and rehabilitation.
High Dimensional Expanders: Random Walks, Pseudorandomness, and Unique Games

Higher order random walks (HD-walks) on high dimensional expanders have played a crucial role in a number of recent breakthroughs in theoretical computer science, perhaps most famously in the recent resolution of the Mihail-Vazirani conjecture (Anari et al. STOC 2019), which focuses on HD-walks on one-sided local-spectral expanders. In this work we study the spectral structure of walks on the stronger two-sided variant, which capture wide generalizations of important objects like the Johnson and Grassmann graphs. We prove that the spectra of these walks are tightly concentrated in a small number of strips, each of which corresponds combinatorially to a level in the underlying complex. Moreover, the eigenvalues corresponding to these strips decay exponentially with a measure we term the depth of the walk. Using this spectral machinery, we characterize the edge-expansion of small sets based upon the interplay of their local combinatorial structure and the global decay of the walk's eigenvalues across strips. Variants of this result for the special cases of the Johnson and Grassmann graphs were recently crucial both for the resolution of the 2-2 Games Conjecture (Khot et al. FOCS 2018), and for efficient algorithms for affine unique games over the Johnson graphs (Bafna et al. Arxiv 2020). For the complete complex, our characterization admits a low-degree Sum of Squares proof. Building on the work of Bafna et al., we provide the first polynomial time algorithm for affine unique games over the Johnson scheme. The soundness and runtime of our algorithm depend upon the number of strips with large eigenvalues, a measure we call High-Dimensional Threshold Rank that calls back to the seminal work of Barak, Raghavendra, and Steurer (FOCS 2011) on unique games and threshold rank.
Deep Reinforcement Learning for Navigation in AAA Video Games

In video games, \non-player characters (NPCs) are used to enhance the players' experience in a variety of ways, e.g., as enemies, allies, or innocent bystanders. A crucial component of NPCs is navigation, which allows them to move from one point to another on the map. The most popular approach for NPC navigation in the video game industry is to use a navigation mesh (NavMesh), which is a graph representation of the map, with nodes and edges indicating traversable areas. Unfortunately, complex navigation abilities that extend the character's capacity for movement, e.g., grappling hooks, jetpacks, teleportation, or double-jumps, increase the complexity of the NavMesh, making it intractable in many practical scenarios. Game designers are thus constrained to only add abilities that can be handled by a NavMesh. As an alternative to the NavMesh, we propose to use Deep Reinforcement Learning (Deep RL) to learn how to navigate 3D maps in video games using any navigation ability. We test our approach on complex 3D environments that are notably an order of magnitude larger than maps typically used in the Deep RL literature. One of these environments is from a recently released AAA video game called Hyper Scape. We find that our approach performs surprisingly well, achieving at least 90% success rate in a variety of scenarios using complex navigation abilities.
Towards Preemptive Detection of Depression and Anxiety in Twitter

Depression and anxiety are psychiatric disorders that are observed in many areas of everyday life. For example, these disorders manifest themselves somewhat frequently in texts written by nondiagnosed users in social media. However, detecting users with these conditions is not a straightforward task as they may not explicitly talk about their mental state, and if they do, contextual cues such as immediacy must be taken into account. When available, linguistic flags pointing to probable anxiety or depression could be used by medical experts to write better guidelines and treatments. In this paper, we develop a dataset designed to foster research in depression and anxiety detection in Twitter, framing the detection task as a binary tweet classification problem. We then apply state-of-the-art classification models to this dataset, providing a competitive set of baselines alongside qualitative error analysis. Our results show that language models perform reasonably well, and better than more traditional baselines. Nonetheless, there is clear room for improvement, particularly with unbalanced training sets and in cases where seemingly obvious linguistic cues (keywords) are used counter-intuitively.
A Neural Network Approach Applied to Multi-Agent Optimal Control

We propose a neural network approach for solving high-dimensional optimal control problems. In particular, we focus on multi-agent control problems with obstacle and collision avoidance. These problems immediately become high-dimensional, even for moderate phase-space dimensions per agent. Our approach fuses the Pontryagin Maximum Principle and Hamilton-Jacobi-Bellman (HJB) approaches and parameterizes the value function with a neural network. Our approach yields controls in a feedback form for quick calculation and robustness to moderate disturbances to the system. We train our model using the objective function and optimality conditions of the control problem. Therefore, our training algorithm neither involves a data generation phase nor solutions from another algorithm. Our model uses empirically effective HJB penalizers for efficient training. By training on a distribution of initial states, we ensure the controls’ optimality is achieved on a large portion of the state-space. Our approach is grid-free and scales efficiently to dimensions where grids become impractical or infeasible. We demonstrate our approach’s effectiveness on a 150-dimensional multi-agent problem with obstacles.
Batchwise Probabilistic Incremental Data Cleaning

Lack of data and data quality issues are among the main bottlenecks that prevent further artificial intelligence adoption within many organizations, pushing data scientists to spend most of their time cleaning data before being able to answer analytical questions. Hence, there is a need for more effective and efficient data cleaning solutions, which, not surprisingly, is rife with theoretical and engineering problems. This report addresses the problem of performing holistic data cleaning incrementally, given a fixed rule set and an evolving categorical relational dataset acquired in sequential batches. To the best of our knowledge, our contributions compose the first incremental framework that cleans data (i) independently of user interventions, (ii) without requiring knowledge about the incoming dataset, such as the number of classes per attribute, and (iii) holistically, enabling multiple error types to be repaired simultaneously, and thus avoiding conflicting repairs. Extensive experiments show that our approach outperforms the competitors with respect to repair quality, execution time, and memory consumption.
Fast Galerkin Method for Solving Helmholtz Boundary Integral Equations on Screens

We solve first-kind Fredholm boundary integral equations arising from Helmholtz and Laplace problems on bounded, smooth screens in three-dimensions with either Dirichlet or Neumann conditions. The proposed Galerkin-Bubnov method takes as discretization elements pushed-forward weighted azimuthal projections of standard spherical harmonics onto the canonical disk. We show that these bases allow for spectral convergence and provide fully discrete error analysis. Numerical experiments support our claims, with results comparable to Nystrom-type and $hp$-methods.
f-IRL: Inverse Reinforcement Learning via State Marginal Matching

Imitation learning is well-suited for robotic tasks where it is difficult to directly program the behavior or specify a cost for optimal control. In this work, we propose a method for learning the reward function (and the corresponding policy) to match the expert state density. Our main result is the analytic gradient of any f-divergence between the agent and expert state distribution w.r. t. reward parameters. Based on the derived gradient, we present an algorithm, f-IRL, that recovers a stationary reward function from the expert density by gradient descent. We show that f-IRL can learn behaviors from a hand-designed target state density or implicitly through expert observations. Our method outperforms adversarial imitation learning methods in terms of sample efficiency and the required number of expert trajectories on IRL benchmarks. Moreover, we show that the recovered reward function can be used to quickly solve downstream tasks, and empirically demonstrate its utility on hard-to-explore tasks and for behavior transfer across changes in dynamics.
F-FADE: Frequency Factorization for Anomaly Detection in Edge Streams

Edge streams are commonly used to capture interactions in dynamic networks, such as email, social, or computer networks. The problem of detecting anomalies or rare events in edge streams has a wide range of applications. However, it presents many challenges due to lack of labels, a highly dynamic nature of interactions, and the entanglement of temporal and structural changes in the network. Current methods are limited in their ability to address the above challenges and to efficiently process a large number of interactions. Here, we propose F-FADE, a new approach for detection of anomalies in edge streams, which uses a novel frequency-factorization technique to efficiently model the time-evolving distributions of frequencies of interactions between node-pairs. The anomalies are then determined based on the likelihood of the observed frequency of each incoming interaction. F-FADE is able to handle in an online streaming setting a broad variety of anomalies with temporal and structural changes, while requiring only constant memory. Our experiments on one synthetic and six real-world dynamic networks show that F-FADE achieves state of the art performance and may detect anomalies that previous methods are unable to find.
Photonic simulation of parafermionic Berry-phase statistics and contextuality

Quasiparticle poisoning is the main obstacle towards the realization of Majorana-based quantum computation. Parafermions, a natural generalization of Majorana fermions, can encode topological qudits immune to quasiparticle poisoning. While parafermions are expected to emerge in superconducting fractional quantum Hall systems they are not yet attainable with current technology. To bypass this problem, we employ a photonic quantum simulator to experimentally demonstrate the key components of parafermion-based universal quantum computation. By manipulating the photonic states we realize Clifford operator Berry phases that correspond to parafermion braiding. Moreover, we demonstrate the contextuality of parafermion encoded qudit states that opens the way to magic state distillation. We finally establish the advantage parafermion qudits have against non-topological ones when they are exposed to local noise. Our photonic quantum simulation provides the first step towards a physically robust methodology for realizing topological quantum computation.
Going Deeper With Directly-Trained Larger Spiking Neural Networks

Spiking neural networks (SNNs) are promising in a bio-plausible coding for spatio-temporal information and event-driven signal processing, which is very suited for energy-efficient implementation in neuromorphic hardware. However, the unique working mode of SNNs makes them more difficult to train than traditional networks. Currently, there are two main routes to explore the training of deep SNNs with high performance. The first is to convert a pre-trained ANN model to its SNN version, which usually requires a long coding window for convergence and cannot exploit the spatio-temporal features during training for solving temporal tasks. The other is to directly train SNNs in the spatio-temporal domain. But due to the binary spike activity of the firing function and the problem of gradient vanishing or explosion, current methods are restricted to shallow architectures and thereby difficult in harnessing large-scale datasets (e.g. ImageNet). To this end, we propose a threshold-dependent batch normalization (tdBN) method based on the emerging spatio-temporal backpropagation, termed “STBP-tdBN”, enabling direct training of a very deep SNN and the efficient implementation of its inference on neuromorphic hardware. With the proposed method and elaborated shortcut connection, we significantly extend directly-trained SNNs from a shallow structure (
Core energy and regularization parameters of non-singular continuum theories of dislocations using atomistic simulations.

The dislocation core is an important region as it controls many important properties of materials. Elasticity breaks down in the core and the stress, force, and energy diverge at the dislocation line. We consider three commonest methods employed in Discrete Dislocation Dynamics (DDD) simulations to eliminate these singularities: (1) considering a cutoff parameter, (2) spreading the Burgers vector (CAWB theory), and (3) using gradient elasticity. Each of these methods includes an extra length parameter to regularize the elastic fields. In this article, we show that these regularization parameters can significantly influence the results of the DDD simulations. We use atomistic simulations for mixed dislocations to find the radius and energy of the dislocation core and find the regularization parameter and its variations with the dislocation character angle in each of the three methods. We have also considered if an arbitrary constant is chosen for the regularization parameter how the core energy should be added to the simulation codes. We have concluded that while the core energy in classical elasticity with a cutoff parameter can be described by one parameter, the other two methods need two energy parameters (core energy of edge and core energy of screw) for describing the variation of the core energy with the character angle. We have shown that no regularization parameter can be selected for the CAWB theory or gradient elasticity if no core energy is included.
VFH+ based shared control for remotely operated mobile robots

This paper addresses the problem of safe and efficient navigation in remotely controlled robots operating in hazardous and unstructured environments; or conducting other remote robotic tasks. A shared control method is presented which blends the commands from a VFH+ obstacle avoidance navigation module with the teleoperation commands provided by an operator via a joypad. The presented approach offers several advantages such as flexibility allowing for a straightforward adaptation of the controller's behaviour and easy integration with variable autonomy systems; as well as the ability to cope with dynamic environments. The advantages of the presented controller are demonstrated by an experimental evaluation in a disaster response scenario. More specifically, presented evidence show a clear performance increase in terms of safety and task completion time compared to a pure teleoperation approach, as well as an ability to cope with previously unobserved obstacles.