Reviewerly/exHarmony huggingface dataset:
Disintegration of Gaussian Measures for Sequential Assimilation of Linear Operator Data

Gaussian processes appear as building blocks in various stochastic models and have been found instrumental to account for imprecisely known, latent functions. It is often the case that such functions may be directly or indirectly evaluated, be it in static or in sequential settings. Here we focus on situations where, rather than pointwise evaluations, evaluations of prescribed linear operators at the function of interest are (sequentially) assimilated. While working with operator data is increasingly encountered in the practice of Gaussian process modelling, mathematical details of conditioning and model updating in such settings are typically by-passed. Here we address these questions by highlighting conditions under which Gaussian process modelling coincides with endowing separable Banach spaces of functions with Gaussian measures, and by leveraging existing results on the disintegration of such measures with respect to operator data. Using recent results on path properties of GPs and their connection to RKHS, we extend the Gaussian process - Gaussian measure correspondence beyond the standard setting of Gaussian random elements in the Banach space of continuous functions. Turning then to the sequential settings, we revisit update formulae in the Gaussian measure framework and establish equalities between final and intermediate posterior mean functions and covariance operators. The latter equalities appear as infinite-dimensional and discretization-independent analogues of Gaussian vector update formulae.
Towards the Neuroevolution of Low-level Artificial General Intelligence

In this work, we argue that the search for Artificial General Intelligence (AGI) should start from a much lower level than human-level intelligence. The circumstances of intelligent behavior in nature resulted from an organism interacting with its surrounding environment, which could change over time and exert pressure on the organism to allow for learning of new behaviors or environment models. Our hypothesis is that learning occurs through interpreting sensory feedback when an agent acts in an environment. For that to happen, a body and a reactive environment are needed. We evaluate a method to evolve a biologically-inspired artificial neural network that learns from environment reactions named Neuroevolution of Artificial General Intelligence (NAGI), a framework for low-level AGI. This method allows the evolutionary complexification of a randomly-initialized spiking neural network with adaptive synapses, which controls agents instantiated in mutable environments. Such a configuration allows us to benchmark the adaptivity and generality of the controllers. The chosen tasks in the mutable environments are food foraging, emulation of logic gates, and cart-pole balancing. The three tasks are successfully solved with rather small network topologies and therefore it opens up the possibility of experimenting with more complex tasks and scenarios where curriculum learning is beneficial.
Point Cloud Attacks in Graph Spectral Domain: When 3D Geometry Meets Graph Signal Processing

With the increasing attention in various 3D safety-critical applications, point cloud learning models have been shown to be vulnerable to adversarial attacks. Although existing 3D attack methods achieve high success rates, they delve into the data space with point-wise perturbation, which may neglect the geometric characteristics. Instead, we propose point cloud attacks from a new perspective -- the graph spectral domain attack, aiming to perturb graph transform coefficients in the spectral domain that corresponds to varying certain geometric structure. Specifically, leveraging on graph signal processing, we first adaptively transform the coordinates of points onto the spectral domain via graph Fourier transform (GFT) for compact representation. Then, we analyze the influence of different spectral bands on the geometric structure, based on which we propose to perturb the GFT coefficients via a learnable graph spectral filter. Considering the low-frequency components mainly contribute to the rough shape of the 3D object, we further introduce a low-frequency constraint to limit perturbations within imperceptible high-frequency components. Finally, the adversarial point cloud is generated by transforming the perturbed spectral representation back to the data domain via the inverse GFT. Experimental results demonstrate the effectiveness of the proposed attack in terms of both the imperceptibility and attack success rates.
PASTA-GAN++: A Versatile Framework for High-Resolution Unpaired Virtual Try-on

Image-based virtual try-on is one of the most promising applications of human-centric image generation due to its tremendous real-world potential. In this work, we take a step forwards to explore versatile virtual try-on solutions, which we argue should possess three main properties, namely, they should support unsupervised training, arbitrary garment categories, and controllable garment editing. To this end, we propose a characteristic-preserving end-to-end network, the PAtch-routed SpaTially-Adaptive GAN++ (PASTA-GAN++), to achieve a versatile system for high-resolution unpaired virtual try-on. Specifically, our PASTA-GAN++ consists of an innovative patch-routed disentanglement module to decouple the intact garment into normalized patches, which is capable of retaining garment style information while eliminating the garment spatial information, thus alleviating the overfitting issue during unsupervised training. Furthermore, PASTA-GAN++ introduces a patch-based garment representation and a patch-guided parsing synthesis block, allowing it to handle arbitrary garment categories and support local garment editing. Finally, to obtain try-on results with realistic texture details, PASTA-GAN++ incorporates a novel spatially-adaptive residual module to inject the coarse warped garment feature into the generator. Extensive experiments on our newly collected UnPaired virtual Try-on (UPT) dataset demonstrate the superiority of PASTA-GAN++ over existing SOTAs and its ability for controllable garment editing.
Balanced Encoding of Near-Zero Correlation for an AES Implementation

Power analysis poses a significant threat to the security of cryptographic algorithms, as it can be leveraged to recover secret keys. While various software-based countermeasures exist to mitigate this non-invasive attack, they often involve a trade-off between time and space constraints. Techniques such as masking and shuffling, while effective, can noticeably impact execution speed and rely heavily on run-time random number generators. On the contrary, internally encoded implementations of block ciphers offer an alternative approach that does not rely on run-time random sources, but it comes with the drawback of requiring substantial memory space to accommodate lookup tables. Internal encoding, commonly employed in white-box cryptography, suffers from a significant security limitation as it does not effectively protect the secret key against statistical analysis. To overcome this weakness, this paper introduces a secure internal encoding method for an AES implementation. By addressing the root cause of vulnerabilities found in previous encoding methods, we propose a balanced encoding technique that aims to minimize the problematic correlation with key-dependent intermediate values. We analyze the potential weaknesses associated with the balanced encoding and present a method that utilizes complementary sets of lookup tables. In this approach, the size of the lookup tables is approximately 512KB, and the number of table lookups is 1,024. This is comparable to the table size of non-protected white-box AES-128 implementations, while requiring only half the number of lookups. By adopting this method, our aim is to introduce a non-masking technique that mitigates the vulnerability to statistical analysis present in current internally-encoded AES implementations.
Graphical Gaussian models associated to a homogeneous graph with permutation symmetries

We consider multivariate centered Gaussian models for the random vector $(Z^1,\ldots, Z^p)$, whose conditional structure is described by a homogeneous graph and which is invariant under the action of a permutation subgroup. The following paper concerns with model selection within colored graphical Gaussian models, when the underlying conditional dependency graph is known. We derive an analytic expression of the normalizing constant of the Diaconis-Ylvisaker conjugate prior for the precision parameter and perform Bayesian model selection in the class of graphical Gaussian models invariant by the action of a permutation subgroup. We illustrate our results with a toy example of dimension $5$.
GPS-GLASS: Learning Nighttime Semantic Segmentation Using Daytime Video and GPS data

Semantic segmentation for autonomous driving should be robust against various in-the-wild environments. Nighttime semantic segmentation is especially challenging due to a lack of annotated nighttime images and a large domain gap from daytime images with sufficient annotation. In this paper, we propose a novel GPS-based training framework for nighttime semantic segmentation. Given GPS-aligned pairs of daytime and nighttime images, we perform cross-domain correspondence matching to obtain pixel-level pseudo supervision. Moreover, we conduct flow estimation between daytime video frames and apply GPS-based scaling to acquire another pixel-level pseudo supervision. Using these pseudo supervisions with a confidence map, we train a nighttime semantic segmentation network without any annotation from nighttime images. Experimental results demonstrate the effectiveness of the proposed method on several nighttime semantic segmentation datasets. Our source code is available at https://github.com/jimmy9704/GPS-GLASS.
A Variational AutoEncoder for Transformers with Nonparametric Variational Information Bottleneck

We propose a VAE for Transformers by developing a variational information bottleneck regulariser for Transformer embeddings. We formalise the embedding space of Transformer encoders as mixture probability distributions, and use Bayesian nonparametrics to derive a nonparametric variational information bottleneck (NVIB) for such attention-based embeddings. The variable number of mixture components supported by nonparametric methods captures the variable number of vectors supported by attention, and the exchangeability of our nonparametric distributions captures the permutation invariance of attention. This allows NVIB to regularise the number of vectors accessible with attention, as well as the amount of information in individual vectors. By regularising the cross-attention of a Transformer encoder-decoder with NVIB, we propose a nonparametric variational autoencoder (NVAE). Initial experiments on training a NVAE on natural language text show that the induced embedding space has the desired properties of a VAE for Transformers.
Is Attention All That NeRF Needs?

We present Generalizable NeRF Transformer (GNT), a transformer-based architecture that reconstructs Neural Radiance Fields (NeRFs) and learns to renders novel views on the fly from source views. While prior works on NeRFs optimize a scene representation by inverting a handcrafted rendering equation, GNT achieves neural representation and rendering that generalizes across scenes using transformers at two stages. (1) The view transformer leverages multi-view geometry as an inductive bias for attention-based scene representation, and predicts coordinate-aligned features by aggregating information from epipolar lines on the neighboring views. (2) The ray transformer renders novel views using attention to decode the features from the view transformer along the sampled points during ray marching. Our experiments demonstrate that when optimized on a single scene, GNT can successfully reconstruct NeRF without an explicit rendering formula due to the learned ray renderer. When trained on multiple scenes, GNT consistently achieves state-of-the-art performance when transferring to unseen scenes and outperform all other methods by ~10% on average. Our analysis of the learned attention maps to infer depth and occlusion indicate that attention enables learning a physically-grounded rendering. Our results show the promise of transformers as a universal modeling tool for graphics. Please refer to our project page for video results: https://vita-group.github.io/GNT/.
Generator Knows What Discriminator Should Learn in Unconditional GANs

Recent methods for conditional image generation benefit from dense supervision such as segmentation label maps to achieve high-fidelity. However, it is rarely explored to employ dense supervision for unconditional image generation. Here we explore the efficacy of dense supervision in unconditional generation and find generator feature maps can be an alternative of cost-expensive semantic label maps. From our empirical evidences, we propose a new generator-guided discriminator regularization(GGDR) in which the generator feature maps supervise the discriminator to have rich semantic representations in unconditional generation. In specific, we employ an U-Net architecture for discriminator, which is trained to predict the generator feature maps given fake images as inputs. Extensive experiments on mulitple datasets show that our GGDR consistently improves the performance of baseline methods in terms of quantitative and qualitative aspects. Code is available at https://github.com/naver-ai/GGDR
LGV: Boosting Adversarial Example Transferability from Large Geometric Vicinity

We propose transferability from Large Geometric Vicinity (LGV), a new technique to increase the transferability of black-box adversarial attacks. LGV starts from a pretrained surrogate model and collects multiple weight sets from a few additional training epochs with a constant and high learning rate. LGV exploits two geometric properties that we relate to transferability. First, models that belong to a wider weight optimum are better surrogates. Second, we identify a subspace able to generate an effective surrogate ensemble among this wider optimum. Through extensive experiments, we show that LGV alone outperforms all (combinations of) four established test-time transformations by 1.8 to 59.9 percentage points. Our findings shed new light on the importance of the geometry of the weight space to explain the transferability of adversarial examples.
Multi-partite subspaces containing no locally inaccessible information

One notion of non-locality in quantum theory is the fact that information may be encoded in a composite system in such a way that it is not accessible through local measurements, even with the assistance of classical communication. Thus, contrary to the classical case, there exists information in quantum many body systems which cannot be accessed locally. We show however that, remarkably, two-dimensional subspaces do not have this property: any physically allowed measurement on information encoded in any two-dimensional subspace, regardless of entanglement or multi-partite structure, may be performed locally. Further, this requires only local measurement and feed-forward of classical information, readily achievable in many experimental platforms. As an application to quantum secret sharing we suggest a twist on a well known quantum information splitting protocol, which ensures that no receiving party ever has access to the full state sent, but parties must work together to perform measurements on the state. These results may have practical applications to the measurement of encoded qubits in e.g. quantum secret sharing, quantum error correction, and reveal a fundamental property unique to two-dimensional subspaces.
Noise correlations behind superdiffusive quantum walks

We study how discrete-time quantum walks behave under short-range correlated noise. By considering noise as a source of inhomogeneity of quantum gates, we introduce a primitive relaxation in the uncorrelated stochastic noise assumption: binary pair correlations manifesting in the random distribution. Considering different quantum gates, we examined the transport properties for both spatial and temporal noise regimes. For spatial inhomogeneities, we show noise correlations driving quantum walks from the well-known exponentially localized condition to superdiffusive spreading. This scenario displays an exciting performance in which the superdiffusive exponent is almost invariant to the inhomogeneity degree. The time-asymptotic regime and the finite-size scaling also unveil an emergent superdiffusive behavior for quantum walks undergoing temporal noise correlation, replacing the diffusive regime exhibited when noise is random and uncorrelated. However, results report some quantum gates insensitive to correlations, contrasting with the spatial noise scenario. Results and following discussions help us understand the underlying mechanism of superdiffusive quantum walks, including those with deterministic aperiodic inhomogeneities.
15th International Contest in Ukrainian Studies of the 8th—11th Graders of General Education Establishments

Results of 15th International Contest in Ukrainian Studies of the 8th—11thGraders of General Education Establishments
Bayesian Evidential Learning for Few-Shot Classification

Few-Shot Classification(FSC) aims to generalize from base classes to novel classes given very limited labeled samples, which is an important step on the path toward human-like machine learning. State-of-the-art solutions involve learning to find a good metric and representation space to compute the distance between samples. Despite the promising accuracy performance, how to model uncertainty for metric-based FSC methods effectively is still a challenge. To model uncertainty, We place a distribution over class probability based on the theory of evidence. As a result, uncertainty modeling and metric learning can be decoupled. To reduce the uncertainty of classification, we propose a Bayesian evidence fusion theorem. Given observed samples, the network learns to get posterior distribution parameters given the prior parameters produced by the pre-trained network. Detailed gradient analysis shows that our method provides a smooth optimization target and can capture the uncertainty. The proposed method is agnostic to metric learning strategies and can be implemented as a plug-and-play module. We integrate our method into several newest FSC methods and demonstrate the improved accuracy and uncertainty quantification on standard FSC benchmarks.
Aspect Term Extraction and Categorization for Chinese MOOC Reviews

Sentiment analysis has become one of the most active topics in education research. So far, however, there has been little discussion about the recent application of sentiment analysis for Chinese MOOC reviews. Therefore, this paper sheds light on some fine-grained sentiment analysis technology to benefit the current students and education practitioners. Firstly, we focus on extracting aspect terms associated with the course via dependency parsing and sentiment word lexicons. Secondly, we categorize the aspect terms with the Naive Bayes. Experimental results effectively demonstrate that the proposed approach and refine the granularity of sentiment categories in higher education. This paper makes sentiment analysis possible to increase students’ learning retention and improve teachers’ performance in online teaching.
novel object detection technique for videos with homogeneous background

Object detection and tracking in video frames play a major role in all the computer vision systems. Several computer vision systems use background subtraction method for detecting the objects. However, Background subtraction method often results in lack of accuracy during frame comparison. Also, it leads to increase in memory requirements and computational complexity while setting threshold. The new Local Mean Diamond Pattern (LMDP) is introduced here to overcome the existing issues by extracting the objects directly from the frames. The extracted objects are tracked using mean shift tracking algorithm. The experimental result shows that the LMDP outperforms the existing methods viz., Local Binary Pattern (LBP), Local Extrema Pattern (LEP) and Local Rhombus Pattern (LRP) in terms of accuracy.
Distribuição uniforme de sequências duplas

The study of the uniform distribution of a real sequence dates back to the research of H. Weyl, W. Sierpińsky and others, in the beginning of the 20th century.There are two classical criteria for classifying evenly distributed sequences modulo 1: the Weyl and the integral criteria.In this paper, we adapt the method of Kuipers and Niederreiter (1974) to extend these results to double sequences.We further prove that sequences of the form ( + ) , , with irrational , are also uniformly distributed modulo 1.
Corruption and Cryptocurrency - Blockchains as corruption tools

Cryptocurrency has become ubiquitous and is evolving constantly. The question is if our legal framework is catching up with it. Therefore, this article analyzes the arguments on the legitimacy and legality of cryptocurrency in order to emphasize the relation between corruption and cryptocurrency. The research has enlightened some cogent arguments on the possibility of perpetrators committing corruption acts through cryptocurrency. These arguments basically refer to some of the unique characteristics of cryptocurrency such as the quick value fluctuation, the difficulties in tractability and the lacking current legislation. The unique features of it may headline cryptocurrency as an immensely attractive environment for corruption activities. Hence the world has already faced some tangled scamming scandals with cryptocurrency specified herein. Therefore, the aim of this article is to highlight the possibility for corruption acts to be committed through cryptocurrency as a form of corruption unknown before.
Showing Leadership through the types of Presupposition in Patriots Day Movie

This study is a pragmatics scope that focused on types and meaning of presupposition in Patriots Day movie which was uttered by the main character (Tommy) by using George Yule’s theory. The movie is a documentary movie that told about true story of bombing action at Boston marathon in 2013. Then, this study also applied qualitative research that uses description and sampling data to be analyzed. In Yule’s theory, he classified six types of presupposition; there are existential, factive, lexical, structural, non-factive and counterfactual presupposition. The result of this study was that all of types were applied by Tommy but existential presupposition was used more frequent than other types. Existential presupposition found 78 data, structural is 19 data, factive is 5 data, lexical also is 4 data, non-factive was 2 data and counter-factual is2 data. Existential presupposition is commonly shown because Tommy as the main character is a sergeant/ leader. He has power, authority and wants to show the existence of situation, condition, people around him and himself by saying utterances that contain its presupposition. Later, he also wants and strives to cover his feeling, weakness, mental pressure from his interlocutors Thus, existential presupposition is more used by Tommy to show the situation that he faced, the power of Tommy as a sergeant and represent his mental pressure during his duty.