If you were asked to visualise a stereotypical British man, what would you think of? According to AI, the answer is an overweight man wearing a football shirt. Instagram account @reimagineuk asked AI to create videos of the most stereotypical men around the world - with hilarious results. While the British man looks casual in his football shirt, men from other countries are depicted with fancier outfits. The stereotypical man from Portugal sports a white shirt and a waistcoat, while the man from Nigeria can be seen wearing a bright orange suit.

Muslims around the world have begun celebrating Eid al-Fitr, one of the biggest celebrations in the Islamic calendar. Eid al-Fitr - which means "festival of the breaking of the fast" - is celebrated at the end of Ramadan, a month of fasting for many adults, as well as spiritual reflection and prayer.ReutersHere in Moscow, worshippers are seen preparing for prayer.ReutersHundreds took part in prayers at Tononoka grounds, in Mombasa, KenyaGetty ImagesPrayers were also observed at a stadium in Port Sudan in the east of the countryGetty ImagesLittle children joined adults at the Moskee Essalam in Rotterdam, NetherlandsGetty ImagesGifts are handed out to Muslim children in Lviv, Ukraine, as Russia's war on the country continuesReuters Palestinians in Jabaliya in the northern Gaza Strip pray amidst the rubble of a mosque destroyed in the current war between Israel and HamasGetty ImagesFamilies gather at al-Aqsa mosque in Jerusalem - the third holiest site in IslamReutersA boy yawns during prayers at a stadium in QatarEPAMuslims greet each-other at Martim Moniz Square in Lisbon, PortugalGetty ImagesWomen worshippers gather in Burgess Park, London, for an outdoor prayerEPAThere were also worshippers gathered outside Plebiscito Square in Naples, ItalyReutersSome women took pictures after attending prayers at the Hagia Sophia Grand Mosque in Istanbul, TurkeyGetty ImagesAfghan refugees pray at a mosque on the outskirts of Peshawar, PakistanMiddle EastEuropeEid al-FitrReligionIslamRelated'I was afraid for my life': At the scene of the attack on Palestinian Oscar winner 5 days agoMiddle EastMore8 hrs ago'In Bradford, families spend thousands on new clothes for Eid' Muslims spend large amounts in Bradford's supermarkets, clothes shops and other services before Eid.8 hrs agoEngland1 day ago The tourist has received an award from the city's mayor after restraining a man during a stabbing.1 day agoEurope1 day ago Another 21 people are injured, as a restaurant and several buildings are set ablaze in the city, local officials say.1 day agoWorld1 day ago Town's successful Ramadan lights project expanded A Scunthorpe community group says it has seen an "amazing" response to its lights display.1 day agoLincolnshire1 day ago Bishop says school that changed Easter events'valued' The BBC is not responsible for the content of external sites.

In this work we introduce the concepts of linguistic transformation, linguistic loop and semantic deficit. By exploiting Lie group theoretical and geometric techniques, we define invariants that capture the structural properties of a whole linguistic loop. This result introduces new line of research, employing tools from Lie theory and higher-dimensional geometry within language studies. But, even more intriguingly, our study hints to a mathematical characterization of the meta-linguistic or pre-verbal thought, namely of those cognitive structures that precede the language.

We consider the robust routing problem with uncertain travel times under the min-max regret criterion, which represents an extended and robust version of the classic traveling salesman problem (TSP) and vehicle routing problem (VRP). The general budget uncertainty set is employed to capture the uncertainty, which provides the capability to control the conservatism of obtained solutions and covers the commonly used interval uncertainty set as a special case. The goal is to obtain a robust solution that minimizes the maximum deviation from the optimal routing time in the worst-case scenario. Given the significant advancements and broad applications of neural combinatorial optimization methods in recent years, we present our initial attempt to combine neural approaches for solving this problem. We propose a dual multi-head cross attention mechanism to extract problem features represented by the inputted uncertainty sets. To tackle the built-in maximization problem, we derive the regret value by invoking a pre-trained model, subsequently utilizing it as the reward during the model training. Our experimental results on the robust TSP and VRP demonstrate the efficacy of our neural combinatorial optimization method, showcasing its ability to efficiently handle the robust routing problem of various sizes within a shorter time compared with alternative heuristic approaches.

Sign language translation (SLT) addresses the problem of translating information from a sign language in video to a spoken language in text. Existing studies, while showing progress, are often limited to narrow domains and/or few sign languages and struggle with open-domain tasks. In this paper, we push forward the frontier of SLT by scaling pretraining data, model size, and number of translation directions. We perform large-scale SLT pretraining on different data including 1) noisy multilingual YouTube SLT data, 2) parallel text corpora, and 3) SLT data augmented by translating video captions to other languages with off-the-shelf machine translation models. We unify different pretraining tasks with task-specific prompts under the encoder-decoder architecture, and initialize the SLT model with pretrained (m/By)T5 models across model sizes. SLT pretraining results on How2Sign and FLEURS-ASL#0 (ASL to 42 spoken languages) demonstrate the significance of data/model scaling and cross-lingual cross-modal transfer, as well as the feasibility of zero-shot SLT.

To ensure large language models (LLMs) are used safely, one must reduce their propensity to hallucinate or to generate unacceptable answers. A simple and often used strategy is to first let the LLM generate multiple hypotheses and then employ a reranker to choose the best one. In this paper, we draw a parallel between this strategy and the use of redundancy to decrease the error rate in noisy communication channels.

The state-of-the-art approximate nearest neighbor search (ANNS) algorithm builds a large proximity graph on the dataset and performs a greedy beam search, which may bring many unnecessary explorations. We develop a novel framework, namely corssing sparse proximity graph (CSPG), based on random partitioning of the dataset. It produces a smaller sparse proximity graph for each partition and routing vectors that bind all the partitions. An efficient two-staged approach is designed for exploring CSPG, with fast approaching and cross-partition expansion. We theoretically prove that CSPG can accelerate the existing graph-based ANNS algorithms by reducing unnecessary explorations. In addition, we conduct extensive experiments on benchmark datasets. The experimental results confirm that the existing graph-based methods can be significantly outperformed by incorporating CSPG, achieving 1.5x to 2x speedups of QPS in almost all recalls.

The metric k-center clustering problem with z outliers, also known as (k, z)-center clustering, involves clustering a given point set P in a metric space (M, d) using at most k balls, minimizing the maximum ball radius while excluding up to z points from the clustering. This problem holds fundamental significance in various domains, such as machine learning, data mining, and database systems. This paper addresses the fully dynamic version of the problem, where the point set undergoes continuous updates (insertions and deletions) over time. The objective is to maintain an approximate (k, z)-center clustering with efficient update times.

An important challenge in machine translation is to generate high-quality and diverse translations. Prior work has shown that the estimated likelihood from the MT model correlates poorly with translation quality. In contrast, quality evaluation metrics (such as COMET or BLEURT) exhibit high correlations with human judgments, which has motivated their use as rerankers (such as quality-aware and minimum Bayes risk decoding). However, relying on a single translation with high estimated quality increases the chances of "gaming the metric". In this paper, we address the problem of sampling a set of high-quality and diverse translations. We provide a simple and effective way to avoid over-reliance on noisy quality estimates by using them as the energy function of a Gibbs distribution. Instead of looking for a mode in the distribution, we generate multiple samples from high-density areas through the Metropolis-Hastings algorithm, a simple Markov chain Monte Carlo approach.

Navigating in environments alongside humans requires agents to reason under uncertainty and account for the beliefs and intentions of those around them. Under a sequential decision-making framework, egocentric navigation can naturally be represented as a Markov Decision Process (MDP). However, social navigation additionally requires reasoning about the hidden beliefs of others, inherently leading to a Partially Observable Markov Decision Process (POMDP), where agents lack direct access to others' mental states. Inspired by Theory of Mind and Epistemic Planning, we propose (1) a neuro-symbolic model-based reinforcement learning architecture for social navigation, addressing the challenge of belief tracking in partially observable environments; and (2) a perspective-shift operator for belief estimation, leveraging recent work on Influence-based Abstractions (IBA) in structured multi-agent settings.