Search

Online platforms have transformed the formal job market but continue to struggle with effectively engaging passive candidates-individuals not actively seeking employment but open to compelling opportunities. We introduce the Independent Halting Cascade (IHC) model, a novel framework that integrates complex network diffusion dynamics with economic game theory to address this challenge. Unlike traditional models that focus solely on information propagation, the IHC model empowers network agents to either disseminate a job posting or halt its spread by applying for the position themselves. By embedding economic incentives into agent decision-making processes, the model creates a dynamic interplay between maximizing information spread and promoting application. Our analysis uncovers distinct behavioral regimes within the IHC model, characterized by critical thresholds in recommendation and application probabilities. Extensive simulations on both synthetic and real-world network topologies demonstrate that the IHC model significantly outperforms traditional direct-recommendation systems in recruiting suitable passive candidates. Specifically, the model achieves up to a 30% higher hiring success rate compared to baseline methods. These findings offer strategic insights into leveraging economic incentives and network structures to enhance recruitment efficiency. The IHC model thus provides a robust framework for modernizing recruitment strategies, particularly in engaging the vast pool of passive candidates in the job market., Comment: 15 pages, 6 figures

Sparse Autoencoders for transformer-based language models are typically defined independently per layer. In this work we analyze statistical relationships between features in adjacent layers to understand how features evolve through a forward pass. We provide a graph visualization interface for features and their most similar next-layer neighbors (https://stefanhex.com/spar-2024/feature-browser/), and build communities of related features across layers. We find that a considerable amount of features are passed through from a previous layer, some features can be expressed as quasi-boolean combinations of previous features, and some features become more specialized in later layers., Comment: Presented at the Attributing Model Behavior at Scale (ATTRIB) workshop at NeurIPS 2024

Open-vocabulary Extreme Multi-label Classification (OXMC) extends traditional XMC by allowing prediction beyond an extremely large, predefined label set (typically $10^3$ to $10^{12}$ labels), addressing the dynamic nature of real-world labeling tasks. However, self-selection bias in data annotation leads to significant missing labels in both training and test data, particularly for less popular inputs. This creates two critical challenges: generation models learn to be "lazy'" by under-generating labels, and evaluation becomes unreliable due to insufficient annotation in the test set. In this work, we introduce Positive-Unlabeled Sequence Learning (PUSL), which reframes OXMC as an infinite keyphrase generation task, addressing the generation model's laziness. Additionally, we propose to adopt a suite of evaluation metrics, F1@$\mathcal{O}$ and newly proposed B@$k$, to reliably assess OXMC models with incomplete ground truths. In a highly imbalanced e-commerce dataset with substantial missing labels, PUSL generates 30% more unique labels, and 72% of its predictions align with actual user queries. On the less skewed EURLex-4.3k dataset, PUSL demonstrates superior F1 scores, especially as label counts increase from 15 to 30. Our approach effectively tackles both the modeling and evaluation challenges in OXMC with missing labels.

The primary objective of most lead optimization campaigns is to enhance the binding affinity of ligands. For large molecules such as antibodies, identifying mutations that enhance antibody affinity is particularly challenging due to the combinatorial explosion of potential mutations. When the structure of the antibody-antigen complex is available, relative binding free energy (RBFE) methods can offer valuable insights into how different mutations will impact the potency and selectivity of a drug candidate, thereby reducing the reliance on costly and time-consuming wet-lab experiments. However, accurately simulating the physics of large molecules is computationally intensive. We present an active learning framework that iteratively proposes promising sequences for simulators to evaluate, thereby accelerating the search for improved binders. We explore different modeling approaches to identify the most effective surrogate model for this task, and evaluate our framework both using pre-computed pools of data and in a realistic full-loop setting.

The nn2poly package provides the implementation in R of the NN2Poly method to explain and interpret feed-forward neural networks by means of polynomial representations that predict in an equivalent manner as the original network.Through the obtained polynomial coefficients, the effect and importance of each variable and their interactions on the output can be represented. This capabiltiy of capturing interactions is a key aspect usually missing from most Explainable Artificial Intelligence (XAI) methods, specially if they rely on expensive computations that can be amplified when used on large neural networks. The package provides integration with the main deep learning framework packages in R (tensorflow and torch), allowing an user-friendly application of the NN2Poly algorithm. Furthermore, nn2poly provides implementation of the required weight constraints to be used during the network training in those same frameworks. Other neural networks packages can also be used by including their weights in list format. Polynomials obtained with nn2poly can also be used to predict with new data or be visualized through its own plot method. Simulations are provided exemplifying the usage of the package alongside with a comparison with other approaches available in R to interpret neural networks.

In this paper, all rings are commutative with nonzero identity. Let M be an R-module. We introduce the concept of phi classical 1-absorbing prime submodules. A proper submodule N of M is a phi classical 1-absorbing prime submodule if whenever non units a, b, c belongs to R and m belongs to M with abcm belongs to N and does not belong to phi(N), then abm belongs to N or cm belongs to N. Many properties and characterizations of phi classical 1-absorbing prime submodules are given., Comment: 18 pages. arXiv admin note: substantial text overlap with arXiv:2403.19659, arXiv:1507.08981, arXiv:1505.06730; text overlap with arXiv:2405.05971

Given an undirected graph G, the edge orientation problem asks for assigning a direction to each edge to convert G into a directed graph. The aim is to minimize the maximum out degree of a vertex in the resulting directed graph. This problem, which is solvable in polynomial time, arises in many applications. An ongoing challenge in edge orientation algorithms is their scalability, particularly in handling large-scale networks with millions or billions of edges efficiently. We propose a novel algorithmic framework based on finding and manipulating simple paths to face this challenge. Our framework is based on an existing algorithm and allows many algorithmic choices. By carefully exploring these choices and engineering the underlying algorithms, we obtain an implementation which is more efficient and scalable than the current state-of-the-art. Our experiments demonstrate significant performance improvements compared to state-of-the-art solvers. On average our algorithm is 6.59 times faster when compared to the state-of-the-art.

We investigate the potential of patent data for improving the antibody humanness prediction using a multi-stage, multi-loss training process. Humanness serves as a proxy for the immunogenic response to antibody therapeutics, one of the major causes of attrition in drug discovery and a challenging obstacle for their use in clinical settings. We pose the initial learning stage as a weakly-supervised contrastive-learning problem, where each antibody sequence is associated with possibly multiple identifiers of function and the objective is to learn an encoder that groups them according to their patented properties. We then freeze a part of the contrastive encoder and continue training it on the patent data using the cross-entropy loss to predict the humanness score of a given antibody sequence. We illustrate the utility of the patent data and our approach by performing inference on three different immunogenicity datasets, unseen during training. Our empirical results demonstrate that the learned model consistently outperforms the alternative baselines and establishes new state-of-the-art on five out of six inference tasks, irrespective of the used metric., Comment: ICML 2024, 14 pages, 6 figures, Code: https://github.com/AstraZeneca/SelfPAD

In this study, we aim to introduce the concept of classical 1-absorbing prime submodules of a nonzero unital module $M$ over a commutative ring $A$ with unity. A proper submodule $P$ of $M$ is said to be a classical 1-absorbing prime submodule, if for each $m\in M$ and nonunits $a,b,c\in A,$ $abcm\in P$ implies that $abm\in P$ or $cm\in P$. We give many examples and properties of classical 1-absorbing prime submodules. Also, we investiage the classical 1-absorbing prime submodules of tensor product $F\otimes M$ of a (faithfully) flat $A$-module $F$ and any $A$-module $M$. Furthermore, we determine classical prime, classical 1-absorbing prime and classical 2-absorbing submodules of amalgamated duplication $M\bowtie I$ of an $A$-module $M$ along an ideal $I$. Also, we characterize local rings $(A,\mathfrak{m})$ with $\mathfrak{m}^{2}=0$ in terms of classical 1-absorbing prime submodules., Comment: 17 pages. arXiv admin note: text overlap with arXiv:2403.19659

In this paper, we study weakly classical 1-absorbing prime submodules of a nonzero unital module $M$ over a commutative ring $R$ having a nonzero identity. A proper submodule $N$ of $M$ is said to be a weakly classical 1-absorbing prime submodule, if for each $m\in M$ and nonunits $a,b,c\in R,$ $0\neq abcm\in N$ implies that $abm\in N$ or $cm\in N$. We give various examples and properties of weakly classical 1-absorbing prime submodules. Also, we investiage the weakly classical 1-absorbing prime submodules of tensor product $F\otimes M$ of a (faithfully) flat $R$-module $F$ and any $R$-module $M.$ Also, we prove that if every proper submodule of an $R$-module $M$ is weakly classical 1-absorbing prime, then $Jac(R)^{3}M=0$. In terms of this result, we characterize modules over local rings in which every proper submodule is weakly classical 1-absorbing prime., Comment: 16 pages

The way we communicate and work has changed significantly with the rise of the Internet. While it has opened up new opportunities, it has also brought about an increase in cyber threats. One common and serious threat is phishing, where cybercriminals employ deceptive methods to steal sensitive information.This study addresses the pressing issue of phishing by introducing an advanced detection model that meticulously focuses on HTML content. Our proposed approach integrates a specialized Multi-Layer Perceptron (MLP) model for structured tabular data and two pretrained Natural Language Processing (NLP) models for analyzing textual features such as page titles and content. The embeddings from these models are harmoniously combined through a novel fusion process. The resulting fused embeddings are then input into a linear classifier. Recognizing the scarcity of recent datasets for comprehensive phishing research, our contribution extends to the creation of an up-to-date dataset, which we openly share with the community. The dataset is meticulously curated to reflect real-life phishing conditions, ensuring relevance and applicability. The research findings highlight the effectiveness of the proposed approach, with the CANINE demonstrating superior performance in analyzing page titles and the RoBERTa excelling in evaluating page content. The fusion of two NLP and one MLP model,termed MultiText-LP, achieves impressive results, yielding a 96.80 F1 score and a 97.18 accuracy score on our research dataset. Furthermore, our approach outperforms existing methods on the CatchPhish HTML dataset, showcasing its efficacies.

Large networks are useful in a wide range of applications. Sometimes problem instances are composed of billions of entities. Decomposing and analyzing these structures helps us gain new insights about our surroundings. Even if the final application concerns a different problem (such as traversal, finding paths, trees, and flows), decomposing large graphs is often an important subproblem for complexity reduction or parallelization. This report is a summary of discussions that happened at Dagstuhl seminar 23331 on "Recent Trends in Graph Decomposition" and presents currently open problems and future directions in the area of (hyper)graph decomposition.

Cataract surgery is a frequently performed procedure that demands automation and advanced assistance systems. However, gathering and annotating data for training such systems is resource intensive. The publicly available data also comprises severe imbalances inherent to the surgical process. Motivated by this, we analyse cataract surgery video data for the worst-performing phases of a pre-trained downstream tool classifier. The analysis demonstrates that imbalances deteriorate the classifier's performance on underrepresented cases. To address this challenge, we utilise a conditional generative model based on Denoising Diffusion Implicit Models (DDIM) and Classifier-Free Guidance (CFG). Our model can synthesise diverse, high-quality examples based on complex multi-class multi-label conditions, such as surgical phases and combinations of surgical tools. We affirm that the synthesised samples display tools that the classifier recognises. These samples are hard to differentiate from real images, even for clinical experts with more than five years of experience. Further, our synthetically extended data can improve the data sparsity problem for the downstream task of tool classification. The evaluations demonstrate that the model can generate valuable unseen examples, allowing the tool classifier to improve by up to 10% for rare cases. Overall, our approach can facilitate the development of automated assistance systems for cataract surgery by providing a reliable source of realistic synthetic data, which we make available for everyone.