Africa
Deep Convolutional Pooling Transformer for Deepfake Detection
Wang, Tianyi, Cheng, Harry, Chow, Kam Pui, Nie, Liqiang
Recently, Deepfake has drawn considerable public attention due to security and privacy concerns in social media digital forensics. As the wildly spreading Deepfake videos on the Internet become more realistic, traditional detection techniques have failed in distinguishing between real and fake. Most existing deep learning methods mainly focus on local features and relations within the face image using convolutional neural networks as a backbone. However, local features and relations are insufficient for model training to learn enough general information for Deepfake detection. Therefore, the existing Deepfake detection methods have reached a bottleneck to further improve the detection performance. To address this issue, we propose a deep convolutional Transformer to incorporate the decisive image features both locally and globally. Specifically, we apply convolutional pooling and re-attention to enrich the extracted features and enhance efficacy. Moreover, we employ the barely discussed image keyframes in model training for performance improvement and visualize the feature quantity gap between the key and normal image frames caused by video compression. We finally illustrate the transferability with extensive experiments on several Deepfake benchmark datasets. The proposed solution consistently outperforms several state-of-the-art baselines on both within- and cross-dataset experiments.
Beyond RMSE: Do machine-learned models of road user interaction produce human-like behavior?
Srinivasan, Aravinda Ramakrishnan, Lin, Yi-Shin, Antonello, Morris, Knittel, Anthony, Hasan, Mohamed, Hawasly, Majd, Redford, John, Ramamoorthy, Subramanian, Leonetti, Matteo, Billington, Jac, Romano, Richard, Markkula, Gustav
Autonomous vehicles use a variety of sensors and machine-learned models to predict the behavior of surrounding road users. Most of the machine-learned models in the literature focus on quantitative error metrics like the root mean square error (RMSE) to learn and report their models' capabilities. This focus on quantitative error metrics tends to ignore the more important behavioral aspect of the models, raising the question of whether these models really predict human-like behavior. Thus, we propose to analyze the output of machine-learned models much like we would analyze human data in conventional behavioral research. We introduce quantitative metrics to demonstrate presence of three different behavioral phenomena in a naturalistic highway driving dataset: 1) The kinematics-dependence of who passes a merging point first 2) Lane change by an on-highway vehicle to accommodate an on-ramp vehicle 3) Lane changes by vehicles on the highway to avoid lead vehicle conflicts. Then, we analyze the behavior of three machine-learned models using the same metrics. Even though the models' RMSE value differed, all the models captured the kinematic-dependent merging behavior but struggled at varying degrees to capture the more nuanced courtesy lane change and highway lane change behavior. Additionally, the collision aversion analysis during lane changes showed that the models struggled to capture the physical aspect of human driving: leaving adequate gap between the vehicles. Thus, our analysis highlighted the inadequacy of simple quantitative metrics and the need to take a broader behavioral perspective when analyzing machine-learned models of human driving predictions.
Randomly Initialized Subnetworks with Iterative Weight Recycling
Gorbett, Matt, Whitley, Darrell
The Multi-Prize Lottery Ticket Hypothesis posits that randomly initialized neural networks contain several subnetworks that achieve comparable accuracy to fully trained models of the same architecture. However, current methods require that the network is sufficiently overparameterized. In this work, we propose a modification to two state-of-the-art algorithms (Edge-Popup and Biprop) that finds high-accuracy subnetworks with no additional storage cost or scaling. The algorithm, Iterative Weight Recycling, identifies subsets of important weights within a randomly initialized network for intra-layer reuse. Empirically we show improvements on smaller network architectures and higher prune rates, finding that model sparsity can be increased through the "recycling" of existing weights. In addition to Iterative Weight Recycling, we complement the Multi-Prize Lottery Ticket Hypothesis with a reciprocal finding: high-accuracy, randomly initialized subnetwork's produce diverse masks, despite being generated with the same hyperparameter's and pruning strategy. We explore the landscapes of these masks, which show high variability.
A source separation approach to temporal graph modelling for computer networks
Detecting malicious activity within an enterprise computer network can be framed as a temporal link prediction task: given a sequence of graphs representing communications between hosts over time, the goal is to predict which edges should--or should not--occur in the future. However, standard temporal link prediction algorithms are ill-suited for computer network monitoring as they do not take account of the peculiar short-term dynamics of computer network activity, which exhibits sharp seasonal variations. In order to build a better model, we propose a source separation-inspired description of computer network activity: at each time step, the observed graph is a mixture of subgraphs representing various sources of activity, and short-term dynamics result from changes in the mixing coefficients. Both qualitative and quantitative experiments demonstrate the validity of our approach.
CRSToday
My team's theoretical and clinical research approach is based on the use of descriptive and predictive mathematical modeling. This has recently been complemented with AI-related resources such as supervised and unsupervised learning. Our goal is twofold: (1) to better understand data collected using biometric and imaging techniques and (2) to increase the diagnostic accuracy or effectiveness of corrective and refractive therapeutic solutions. Thus far, the models and techniques have been applied mainly to refractive surgery, topography and corneal imaging for keratoconus screening, ocular wavefront description, complex optical comparison and design in cataract surgery, ocular biometry, and IOL calculation. The improvements to diagnostic tools include screening or characterization of keratoconus, corneal edema, and ocular wavefront; the improvements to therapeutic tools include ablation profiles, IOL calculations, and diffractive optics.
AI Is Exposing Who Really Has Power in Silicon Valley
Silicon Valley churns out new products all the time, but rarely does one receive the level of hype that has surrounded the release of GPT-4. The follow-up to ChatGPT can ace standardized tests, tell you why a meme is funny, and even help do your taxes. Since the San Francisco start-up OpenAI introduced the technology earlier this month, it has been branded as "remarkable but unsettling," and has led to grandiose statements about how "things will never be the same." But actually trying out these features for yourself--or at least the ones that have already been publicly released--does not come cheap. Unlike ChatGPT, which captivated the world because it was free, GPT-4 is currently only available to non-developers through a premium service that costs $20 a month.
OpenAI Expands ChatGPT's Capabilities With The Introduction Of Plugins
ChatGPT is one of the most advanced and popular chatbots in the world, powered by OpenAI's generative pre-trained transformer (GPT) models. ChatGPT can generate natural and engaging responses to a variety of topics and contexts, using its large-scale language understanding and generation capabilities. However, until recently, ChatGPT had a major limitation: it could not access the internet or any external data sources or services. This meant that ChatGPT could only rely on its internal knowledge and memory, which might be outdated, incomplete, or inaccurate. For example, if you asked ChatGPT about the latest news, sports scores, or weather forecasts, it would not be able to give you a reliable answer.
AI Could Make More Work for Us, Instead of Simplifying Our Lives
There's a common perception that artificial intelligence (AI) will help streamline our work. There are even fears that it could wipe out the need for some jobs altogether. But in a study of science laboratories I carried out with three colleagues at the University of Manchester, the introduction of automated processes that aim to simplify work--and free people's time--can also make that work more complex, generating new tasks that many workers might perceive as mundane. In the study, published in Research Policy, we looked at the work of scientists in a field called synthetic biology, or synbio for short. Synbio is concerned with redesigning organisms to have new abilities.
FEATHERS: Federated Architecture and Hyperparameter Search
Seng, Jonas, Prasad, Pooja, Mundt, Martin, Dhami, Devendra Singh, Kersting, Kristian
Deep neural architectures have profound impact on achieved performance in many of today's AI tasks, yet, their design still heavily relies on human prior knowledge and experience. Neural architecture search (NAS) together with hyperparameter optimization (HO) helps to reduce this dependence. However, state of the art NAS and HO rapidly become infeasible with increasing amount of data being stored in a distributed fashion, typically violating data privacy regulations such as GDPR and CCPA. As a remedy, we introduce FEATHERS - $\textbf{FE}$derated $\textbf{A}$rchi$\textbf{T}$ecture and $\textbf{H}$yp$\textbf{ER}$parameter $\textbf{S}$earch, a method that not only optimizes both neural architectures and optimization-related hyperparameters jointly in distributed data settings, but further adheres to data privacy through the use of differential privacy (DP). We show that FEATHERS efficiently optimizes architectural and optimization-related hyperparameters alike, while demonstrating convergence on classification tasks at no detriment to model performance when complying with privacy constraints.
SilverAlign: MT-Based Silver Data Algorithm For Evaluating Word Alignment
Köksal, Abdullatif, Severini, Silvia, Schütze, Hinrich
Word alignments are essential for a variety of NLP tasks. Therefore, choosing the best approaches for their creation is crucial. However, the scarce availability of gold evaluation data makes the choice difficult. We propose SilverAlign, a new method to automatically create silver data for the evaluation of word aligners by exploiting machine translation and minimal pairs. We show that performance on our silver data correlates well with gold benchmarks for 9 language pairs, making our approach a valid resource for evaluation of different domains and languages when gold data are not available. This addresses the important scenario of missing gold data alignments for low-resource languages.