Miracle-dz/UniFAR-FTUs huggingface dataset:
Joint Port Selection Based Channel Acquisition for FDD Cell-Free Massive MIMO

In frequency division duplexing (FDD) cell-free massive MIMO, the acquisition of the channel state information (CSI) is very challenging because of the large overhead required for the training and feedback of the downlink channels of multiple cooperating base stations (BSs). In this paper, for systems with partial uplink-downlink channel reciprocity, and a general spatial domain channel model with variations in the average port power and correlation among port coefficients, we propose a joint-port-selection-based CSI acquisition and feedback scheme for the downlink transmission with zero-forcing precoding. The scheme uses an eigenvalue-decomposition-based transformation to reduce the feedback overhead by exploring the port correlation. We derive the sum-rate of the system for any port selection. Based on the sum-rate result, we propose a low-complexity greedy-search-based joint port selection (GS-JPS) algorithm. Moreover, to adapt to fast time-varying scenarios, a supervised deep learning-enhanced joint port selection (DL-JPS) algorithm is proposed. Simulations verify the effectiveness of our proposed schemes and their advantage over existing port-selection channel acquisition schemes.
Cross-Corpus Multilingual Speech Emotion Recognition: Amharic vs. Other Languages

In a conventional speech emotion recognition (SER) task, a classifier for a given language is trained on a pre-existing dataset for that same language. However, where training data for a language do not exist, data from other languages can be used instead. We experiment with cross-lingual and multilingual SER, working with Amharic, English, German, and Urdu. For Amharic, we use our own publicly available Amharic Speech Emotion Dataset (ASED). For English, German and Urdu, we use the existing RAVDESS, EMO-DB, and URDU datasets. We followed previous research in mapping labels for all of the datasets to just two classes: positive and negative. Thus, we can compare performance on different languages directly and combine languages for training and testing. In Experiment 1, monolingual SER trials were carried out using three classifiers, AlexNet, VGGE (a proposed variant of VGG), and ResNet50. The results, averaged for the three models, were very similar for ASED and RAVDESS, suggesting that Amharic and English SER are equally difficult. Similarly, German SER is more difficult, and Urdu SER is easier. In Experiment 2, we trained on one language and tested on another, in both directions for each of the following pairs: Amharic↔German, Amharic↔English, and Amharic↔Urdu. The results with Amharic as the target suggested that using English or German as the source gives the best result. In Experiment 3, we trained on several non-Amharic languages and then tested on Amharic. The best accuracy obtained was several percentage points greater than the best accuracy in Experiment 2, suggesting that a better result can be obtained when using two or three non-Amharic languages for training than when using just one non-Amharic language. Overall, the results suggest that cross-lingual and multilingual training can be an effective strategy for training an SER classifier when resources for a language are scarce.
Involvement of calcium channels Orai3 in the chemoresistance to cisplatin in non-small cell lung cancer (NSCLC)

This is the second part of the previous review. In the previous review we suspected that Orai3 channels were involved in lung cancer and more precisely in several cancers. Here we confirm that calcium dysregulation is important for cancer development. in this paper we show that Orai3 is an upstream activator of AKT and we prove that AKT is involved in chemoresistance in NSCLC.
Self2Self+: Single-Image Denoising with Self-Supervised Learning and Image Quality Assessment Loss

Recently, denoising methods based on supervised learning have exhibited promising performance. However, their reliance on external datasets containing noisy-clean image pairs restricts their applicability. To address this limitation, researchers have focused on training denoising networks using solely a set of noisy inputs. To improve the feasibility of denoising procedures, in this study, we proposed a single-image self-supervised learning method in which only the noisy input image is used for network training. Gated convolution was used for feature extraction and no-reference image quality assessment was used for guiding the training process. Moreover, the proposed method sampled instances from the input image dataset using Bernoulli sampling with a certain dropout rate for training. The corresponding result was produced by averaging the generated predictions from various instances of the trained network with dropouts. The experimental results indicated that the proposed method achieved state-of-the-art denoising performance on both synthetic and real-world datasets. This highlights the effectiveness and practicality of our method as a potential solution for various noise removal tasks.
Instruction-following Evaluation through Verbalizer Manipulation

While instruction-tuned models have shown remarkable success in various natural language processing tasks, accurately evaluating their ability to follow instructions remains challenging. Existing benchmarks primarily focus on common instructions that align well with what the model learned during training. However, proficiency in responding to these instructions does not necessarily imply strong ability in instruction following. In this paper, we propose a novel instruction-following evaluation protocol called verbalizer manipulation. It instructs the model to verbalize the task label with words aligning with model priors to different extents, adopting verbalizers from highly aligned (e.g., outputting ``postive'' for positive sentiment), to minimally aligned (e.g., outputting ``negative'' for positive sentiment). Verbalizer manipulation can be seamlessly integrated with any classification benchmark to examine the model's reliance on priors and its ability to override them to accurately follow the instructions. We conduct a comprehensive evaluation of four major model families across nine datasets, employing twelve sets of verbalizers for each of them. We observe that the instruction-following abilities of models, across different families and scales, are significantly distinguished by their performance on less natural verbalizers. Even the strongest GPT-4 model struggles to perform better than random guessing on the most challenging verbalizer, emphasizing the need for continued advancements to improve their instruction-following abilities.
Discreteness Unravels the Black Hole Information Puzzle: Insights from a Quantum Gravity Toy Model

The black hole information puzzle can be resolved if two conditions are met. The first is that the information about what falls inside a black hole remains encoded in degrees of freedom that persist after the black hole completely evaporates. These degrees of freedom should be capable of purifying the information. The second is if these purifying degrees of freedom do not significantly contribute to the system’s energy, as the macroscopic mass of the initial black hole has been radiated away as Hawking radiation to infinity. The presence of microscopic degrees of freedom at the Planck scale provides a natural mechanism for achieving these two conditions without running into the problem of the large pair-creation probabilities of standard remnant scenarios. In the context of Hawking radiation, the first condition implies that correlations between the in and out Hawking partner particles need to be transferred to correlations between the microscopic degrees of freedom and the out partners in the radiation. This transfer occurs dynamically when the in partners reach the singularity inside the black hole, entering the UV regime of quantum gravity where the interaction with the microscopic degrees of freedom becomes strong. The second condition suggests that the conventional notion of the vacuum’s uniqueness in quantum field theory should fail when considering the full quantum gravity degrees of freedom. In this paper, we demonstrate both key aspects of this mechanism using a solvable toy model of a quantum black hole inspired by loop quantum gravity.
Hypergraph Diffusions and Resolvents for Norm-Based Hypergraph Laplacians

The development of simple and fast hypergraph spectral methods has been hindered by the lack of numerical algorithms for simulating heat diffusions and computing fundamental objects, such as Personalized PageRank vectors, over hypergraphs. In this paper, we overcome this challenge by designing two novel algorithmic primitives. The first is a simple, easy-to-compute discrete-time heat diffusion that enjoys the same favorable properties as the discrete-time heat diffusion over graphs. This diffusion can be directly applied to speed up existing hypergraph partitioning algorithms. Our second contribution is the novel application of mirror descent to compute resolvents of non-differentiable squared norms, which we believe to be of independent interest beyond hypergraph problems. Based on this new primitive, we derive the first nearly-linear-time algorithm that simulates the discrete-time heat diffusion to approximately compute resolvents of the hypergraph Laplacian operator, which include Personalized PageRank vectors and solutions to the hypergraph analogue of Laplacian systems. Our algorithm runs in time that is linear in the size of the hypergraph and inversely proportional to the hypergraph spectral gap $\lambda_G$, matching the complexity of analogous diffusion-based algorithms for the graph version of the problem.
Exploring the Landscape of Natural Language Processing Research

As an efficient approach to understand, generate, and process natural language texts, research in natural language processing (NLP) has exhibited a rapid spread and wide adoption in recent years. Given the increasing research work in this area, several NLP-related approaches have been surveyed in the research community. However, a comprehensive study that categorizes established topics, identifies trends, and outlines areas for future research remains absent. Contributing to closing this gap, we have systematically classified and analyzed research papers in the ACL Anthology. As a result, we present a structured overview of the research landscape, provide a taxonomy of fields of study in NLP, analyze recent developments in NLP, summarize our findings, and highlight directions for future work.
Network Combination to Persistence of High-dimensional Delayed Complex Balanced Mass-action Systems

Complex balanced mass-action systems (CBMASs) are of great importance in the filed of biochemical reaction networks. However analyzing the persistence of these networks with high dimensions and time delays poses significant challenges. To tackle this, we propose a novel approach that combines 1-dimensional (1d) or 2d delayed CBMASs (DeCBMASs) and introduces inheritable combination methods based on the relationship between semilocking sets and intersecting species. These methods account for various scenarios, including cases where the set of intersecting species is empty, or there are no common species in non-trivial semilocking sets and the intersecting species set, or when special forms are present. By utilizing these combination methods, we derive sufficient conditions for the persistence of high-dimensional DeCBMASs. This significantly expands the known class of delayed chemical reaction network systems that exhibit persistence. The effectiveness of our proposed approach is also demonstrated through several examples, highlighting its practical applicability in real-world scenarios. This research contributes to advancing the understanding of high-dimensional DeCBMASs and offers insights into their persistent behavior.
Emergence of diverse epidermal patterns by integrating Turing pattern model and majority voting model

The Turing pattern model is one type of reaction-diffusion (RD) model, which explains pattern formation from the interaction of active and inhibitory factors. However, this Turing model was not recognized for a long time as a model that could explain pattern formation in living organisms, due to the lack of concrete experimental evidence. The first identification of pattern formation by the Turing pattern model in an actual animal was made in the 1990s with the observation of patterns in the sea anemone. Although the biochemical mechanisms of pattern formation are still under study, the fact that the formation of some of the body patterns is consistent with models of the RD equation, such as the Turing pattern. But can we assume that all epidermal patterns in animals can be explained by the Turing pattern model (or its relate models)? Even for fish, there are some fish that are clearly not Turing patterns, differing significantly from the patterns that can be generated by RD models. For example, the body pattern of the ornamental carp Nishiki goi produced in Japan varies randomly from individual to individual. Patterns vary randomly from individual to individual, and it is difficult to predict the pattern of the offspring from that of the parent fish. A model in which these fish patterns are formed randomly is the majority voting model. The model is a cellular automaton model (state is 0 or 1) that uses the sum rule of the Moore neighborhood, by majority vote. The time evolution of this model from a random initial state strongly depends on the ratio or distribution of 1s and 0s in the initial state. From this, it can be inferred that the epidermal pattern of fish can be explained by either the Turing pattern model or the majority voting model. But how do fish use these two different models? Patterns from this two-type model can also be found among very closely related species. It is hard to imagine that completely different epidermal formation mechanisms are used among species of the same family. For this reason, there may be a more basic model that can produce patterns for either model. In this study, the Turing pattern model and the majority voting model were represented by cellular automata, and then a new model integrating these two models was proposed. By adjusting the parameters, this integrated model was able to create patterns that
A Step Towards Worldwide Biodiversity Assessment: The BIOSCAN-1M Insect Dataset

In an effort to catalog insect biodiversity, we propose a new large dataset of hand-labelled insect images, the BIOSCAN-Insect Dataset. Each record is taxonomically classified by an expert, and also has associated genetic information including raw nucleotide barcode sequences and assigned barcode index numbers, which are genetically-based proxies for species classification. This paper presents a curated million-image dataset, primarily to train computer-vision models capable of providing image-based taxonomic assessment, however, the dataset also presents compelling characteristics, the study of which would be of interest to the broader machine learning community. Driven by the biological nature inherent to the dataset, a characteristic long-tailed class-imbalance distribution is exhibited. Furthermore, taxonomic labelling is a hierarchical classification scheme, presenting a highly fine-grained classification problem at lower levels. Beyond spurring interest in biodiversity research within the machine learning community, progress on creating an image-based taxonomic classifier will also further the ultimate goal of all BIOSCAN research: to lay the foundation for a comprehensive survey of global biodiversity. This paper introduces the dataset and explores the classification task through the implementation and analysis of a baseline classifier.
Variational Autoencoding of Dental Point Clouds

Digital dentistry has made significant advancements, yet numerous challenges remain. This paper introduces the FDI 16 dataset, an extensive collection of tooth meshes and point clouds. Additionally, we present a novel approach: Variational FoldingNet (VF-Net), a fully probabilistic variational autoencoder designed for point clouds. Notably, prior latent variable models for point clouds lack a one-to-one correspondence between input and output points. Instead, they rely on optimizing Chamfer distances, a metric that lacks a normalized distributional counterpart, rendering it unsuitable for probabilistic modeling. We replace the explicit minimization of Chamfer distances with a suitable encoder, increasing computational efficiency while simplifying the probabilistic extension. This allows for straightforward application in various tasks, including mesh generation, shape completion, and representation learning. Empirically, we provide evidence of lower reconstruction error in dental reconstruction and interpolation, showcasing state-of-the-art performance in dental sample generation while identifying valuable latent representations.
Mitigating Voter Attribute Bias for Fair Opinion Aggregation

The aggregation of multiple opinions plays a crucial role in decision-making, such as in hiring and loan review, and in labeling data for supervised learning. Although majority voting and existing opinion aggregation models are effective for simple tasks, they are inappropriate for tasks without objectively true labels in which disagreements may occur. In particular, when voter attributes such as gender or race introduce bias into opinions, the aggregation results may vary depending on the composition of voter attributes. A balanced group of voters is desirable for fair aggregation results but may be difficult to prepare. In this study, we consider methods to achieve fair opinion aggregation based on voter attributes and evaluate the fairness of the aggregated results. To this end, we consider an approach that combines opinion aggregation models such as majority voting and the Dawid and Skene model (D&S model) with fairness options such as sample weighting. To evaluate the fairness of opinion aggregation, probabilistic soft labels are preferred over discrete class labels. First, we address the problem of soft label estimation without considering voter attributes and identify some issues with the D&S model. To address these limitations, we propose a new Soft D&S model with improved accuracy in estimating soft labels. Moreover, we evaluated the fairness of an opinion aggregation model, including Soft D&S, in combination with different fairness options using synthetic and semi-synthetic data. The experimental results suggest that the combination of Soft D&S and data splitting as a fairness option is effective for dense data, whereas weighted majority voting is effective for sparse data. These findings should prove particularly valuable in supporting decision-making by human and machine-learning models with balanced opinion aggregation.
Classification of Visualization Types and Perspectives in Patents

Due to the swift growth of patent applications each year, information and multimedia retrieval approaches that facilitate patent exploration and retrieval are of utmost importance. Different types of visualizations (e.g., graphs, technical drawings) and perspectives (e.g., side view, perspective) are used to visualize details of innovations in patents. The classification of these images enables a more efficient search and allows for further analysis. So far, datasets for image type classification miss some important visualization types for patents. Furthermore, related work does not make use of recent deep learning approaches including transformers. In this paper, we adopt state-of-the-art deep learning methods for the classification of visualization types and perspectives in patent images. We extend the CLEF-IP dataset for image type classification in patents to ten classes and provide manual ground truth annotations. In addition, we derive a set of hierarchical classes from a dataset that provides weakly-labeled data for image perspectives. Experimental results have demonstrated the feasibility of the proposed approaches. Source code, models, and dataset will be made publicly available.
Bounded Combinatorial Reconfiguration with Answer Set Programming

We develop an approach called bounded combinatorial reconfiguration for solving combinatorial reconfiguration problems based on Answer Set Programming (ASP). The general task is to study the solution spaces of source combinatorial problems and to decide whether or not there are sequences of feasible solutions that have special properties. The resulting recongo solver covers all metrics of the solver track in the most recent international competition on combinatorial reconfiguration (CoRe Challenge 2022). recongo ranked first in the shortest metric of the single-engine solvers track. In this paper, we present the design and implementation of bounded combinatorial reconfiguration, and present an ASP encoding of the independent set reconfiguration problem that is one of the most studied combinatorial reconfiguration problems. Finally, we present empirical analysis considering all instances of CoRe Challenge 2022.
What can we learn from Data Leakage and Unlearning for Law?

Large Language Models (LLMs) have a privacy concern because they memorize training data (including personally identifiable information (PII) like emails and phone numbers) and leak it during inference. A company can train an LLM on its domain-customized data which can potentially also include their users' PII. In order to comply with privacy laws such as the"right to be forgotten", the data points of users that are most vulnerable to extraction could be deleted. We find that once the most vulnerable points are deleted, a new set of points become vulnerable to extraction. So far, little attention has been given to understanding memorization for fine-tuned models. In this work, we also show that not only do fine-tuned models leak their training data but they also leak the pre-training data (and PII) memorized during the pre-training phase. The property of new data points becoming vulnerable to extraction after unlearning and leakage of pre-training data through fine-tuned models can pose significant privacy and legal concerns for companies that use LLMs to offer services. We hope this work will start an interdisciplinary discussion within AI and law communities regarding the need for policies to tackle these issues.
The Hessian correspondence of hypersurfaces of degree 3 and 4

Let $X$ be a hypersurface, of degree $d$, in an $n$--dimensional projective space. The Hessian map is a rational map from $X$ to the projective space of symmetric matrices that sends a point $p\in X$ to the Hessian matrix of the defining polynomial of $X$ evaluated at $p$. The Hessian correspondence is the map that sends a hypersurface to its Hessian variety; i.e. the Zariski closure of its image via the Hessian map. In this paper, we study this correspondence for hypersurfaces with Waring rank at most $n+1$ and for hypersurfaces of degree $3$ and $4$. We prove that, for hypersurfaces with Waring rank $k\leq n+1$, the map is birational onto its image for $d$ even, and it is generically finite of degree $2^{k-1}$ for $d$ odd. We prove that, for degree $3$ and $n=1$, the map is two to one, and that, for degree $3$ and $n\geq 2$, and for degree $4$, the Hessian correspondence is birational. In this study, we introduce the $k$--gradients varieties and analyze their main properties. We provide effective algorithms for recovering a hypersurface from its Hessian variety, for degree $3$ and $n\geq 1$, and for degree $4$ and $n$ even.