United States

Messenger RNA (mRNA)-based vaccines are accelerating the discovery of new drugs and revolutionizing the pharmaceutical industry. However, selecting particular mRNA sequences for vaccines and therapeutics from extensive mRNA libraries is costly. Effective mRNA therapeutics require carefully designed sequences with optimized expression levels and stability. This paper proposes a novel contextual language model (LM)-based embedding method: mRNA2vec. In contrast to existing mRNA embedding approaches, our method is based on the self-supervised teacher-student learning framework of data2vec. We jointly use the 5&#39; untranslated region (UTR) and coding sequence (CDS) region as the input sequences. We adapt our LM-based approach specifically to mRNA by 1) considering the importance of location on the mRNA sequence with probabilistic masking, 2) using Minimum Free Energy (MFE) prediction and Secondary Structure (SS) classification as additional pretext tasks. mRNA2vec demonstrates significant improvements in translation efficiency (TE) and expression level (EL) prediction tasks in UTR compared to SOTA methods such as UTR-LM. It also gives a competitive performance in mRNA stability and protein production level tasks in CDS such as CodonBERT.

AAAI 2025

mRNA2vec: mRNA Embedding with Language Model in the 5&#39;UTR-CDS for mRNA Design

other applications

Congratulations to all the researchers who have qualified for the AMA Research Challenge virtual poster symposium and semifinals!

Welcome to the **largest national, multi-specialty research event** featuring research from nearly 1,000 medical students, residents, fellows, and international medical graduates across six topic areas - basic science, clinical and translational research, clinical vignettes, health systems science, medical education, and public health and health policy.

#### Access the Event
Use the buttons below or navigation menu to access the event. 

[![](https://assets.underline.io/markdown_image/1/image/d4076f2146939317a29eb9f69c53ad41.png)](https://underline.io/events/506/sessions?searchGroup=all)
[![](https://assets.underline.io/markdown_image/1/image/6bcee0b523a4874c4292ca0415d88dde.png)](https://underline.io/events/506/posters?searchGroup=all)

#### Event Details
The 2025 AMA Research Challenge includes the following symposium halls:
* **Semifinals hall:** Features research from 54 medical students, residents and international medical graduates that received top scores during first round scoring. 
* **Poster symposium hall:** Features research from nearly 1,000 medical students, residents and international medical graduates categorized by topics and subtopics.

**Here’s how to participate:**
* **View posters and presentations** on a variety of topics and specialties
* **Score posters in the semifinals** to help decide the top five finalists (AMA member exclusive opportunity)
* **Connect with presenters** and provide feedback to help advance their research
* **New this year: Watch live poster presentations** by topic area and engage directly with researchers

At the conclusion of this event, the AMA announced the top five finalists who advanced to the AMA Research Challenge final round, presented their research to an elite panel of judges, and competed to win a $10,000 grand prize presented by Laurel Road.

**Addison Shenk, a fourth-year medical student from Edward Via Virginia College of Osteopathic Medicine, was the winner of the 2025 AMA Research Challenge and was awarded the grand prize of $10,000, presented by Laurel Road.**

#### A message from Dr. Bobby Mukkamala, AMA President
<div style="position: relative; width: 100%; padding-bottom: 56.25%; height: 0; overflow: hidden;">
  <iframe 
    src="https://underline.io/embed/136894-ama-video?t=0"
    title="AMA Welcome Video"
    allowfullscreen
    style="position: absolute; top: 0; left: 0; width: 100%; height: 100%; border: 0;">
  </iframe>
</div>


#### Recognized Institutions
In 2025, 1,400 abstracts were submitted across six topic areas representing 174 medical schools and more than 150 residency and health care institutions. [See if your institution is represented this year!](https://drive.google.com/file/d/1eFrTqCmCeobx9pr5drJK2hllvsIpFNOY/view?usp=drive_link)

#### Grand Prize Sponsor
AMA would like to thank Laurel Road, a brand of KeyBank, for sponsoring a $10,000 grand prize for the winner of the AMA Research Challenge. Laurel Road and KeyBank are not involved in winner selection process. The winner will be announced during the AMA Research Challenge final round. Payment of the grand prize will be directly from Laurel Road/KeyBank. See the [AMA Research Challenge Official Rules for terms and conditions](https://www.ama-assn.org/system/files/research-challenge-official-rules.pdf).

[![](https://assets.underline.io/uploads/markdown_image/1/image/611e331d4a0eba0920f240cfc04b4d77.png)](https://www.laurelroad.com/)

#### Code of Conduct
<html>
AMA has a code of conduct for its meetings – we ask all attendees to adhere to this code to participate in this year’s meeting. Please read and <a href="https://www.ama-assn.org/about/code-conduct" target="_blank">learn more here</a> about your conduct requirements.
<br><br>
	</html>
	

#### Semifinals Judges

You need to log in with the email address you registered with. Access credentials have been sent to your email. 

Please be sure to check your spam and other email folders if you do not see an email confirmation right away.

Need help? Contact us at <support@underline.io>.

Please log in to explore this event.

If you have used the AMA Research Challenge platform previously, please click the ‘Log-in’ button below. If you do not remember your password, please click “forgot password” and follow prompts to reset your password. After resetting your password, please refresh your webpage to access the platform. 

Register to explore research in a variety of topics. AMA members get exclusive access to score posters in the semifinals. 

**Please use [this link here](https://www.ama-assn.org/member-benefits/events/ama-research-challenge) to register for free. **

Registration Is Required

AMA Research Challenge 2025 

Join the AMA Research Challenge poster symposium and semifinals to explore top research posters and score posters in the semifinals (an AMA member exclusive opportunity).

Messenger RNA (mRNA)-based vaccines are accelerating the discovery of new drugs and revolutionizing the pharmaceutical industry. However, selecting particular mRNA sequences for vaccines and therapeutics from extensive mRNA libraries is costly. Effective mRNA therapeutics require carefully designed sequences with optimized expression levels and stability. This paper proposes a novel contextual language model (LM)-based embedding method: mRNA2vec. In contrast to existing mRNA embedding approaches, our method is based on the self-supervised teacher-student learning framework of data2vec. We jointly use the 5' untranslated region (UTR) and coding sequence (CDS) region as the input sequences. We adapt our LM-based approach specifically to mRNA by 1) considering the importance of location on the mRNA sequence with probabilistic masking, 2) using Minimum Free Energy (MFE) prediction and Secondary Structure (SS) classification as additional pretext tasks. mRNA2vec demonstrates significant improvements in translation efficiency (TE) and expression level (EL) prediction tasks in UTR compared to SOTA methods such as UTR-LM. It also gives a competitive performance in mRNA stability and protein production level tasks in CDS such as CodonBERT.

mRNA2vec: mRNA Embedding with Language Model in the 5'UTR-CDS for mRNA Design

poster

We are pleased to announce the Thirty-Ninth AAAI Conference on Artificial Intelligence (AAAI-25), which will be held in Philadelphia, Pennsylvania at the Pennsylvania Convention Center from February 25 to March 4, 2025.

The purpose of the AAAI conference series is to promote research in Artificial Intelligence (AI) and foster scientific exchange between researchers, practitioners, scientists, students, and engineers across the entirety of AI and its affiliated disciplines. AAAI-25 will feature technical paper presentations, special tracks, invited speakers, workshops, tutorials, poster sessions, senior member presentations, competitions, and exhibit programs, and a range of other activities to be announced.

### [Invited Speakers](https://aaai.org/conference/aaai/aaai-25/aaai-25-invited-speakers/)<br><br><br>

Register [here](https://aaai.org/conference/aaai/aaai-25/registration/)<br><br> 

The purpose of the AAAI conference series is to promote research in Artificial Intelligence (AI) and foster scientific exchange between researchers, practitioners, scientists, students, and engineers across the entirety of AI and its affiliated disciplines. AAAI-25 will feature technical paper presentations, special tracks, invited speakers, workshops, tutorials, poster sessions, senior member presentations, competitions, and exhibit programs, and a range of other activities to be announced.



List Update is a fundamental problem in online algorithms, with a well-known $2$-competitive algorithm that moves every requested element to the front. Randomization can slightly improve the competitive ratio to $1.6$, but not beyond $1.5$. However, practical inputs are not adversarial and one hopes to do better, particularly when additional information from a machine learning oracle is available. With access to predictions, the goal is to incur only a slight overhead compared to the prediction's accuracy, avoiding significant costs in case of substantial deviation.

We propose a $(1+\epsilon)$-smooth randomized algorithm, offering robustness of $O(1/\epsilon^4)$. This guarantees that the algorithm never exceeds a cost greater than $1+\epsilon$ times the prediction cost, while maintaining a bound within $O(1/\epsilon^4)$ of the optimal cost for every possible sequence. In cases where no paid swaps are permitted for the prediction, we can improve robustness to $O(1/\epsilon^2)$ while retaining $1+\epsilon$ smoothness. We complement these findings by demonstrating a lower bound of $\Omega(1/\epsilon)$ on the robustness for deterministic algorithms and $\Omega(\log(1/\epsilon))$ for randomized ones. 
Finally, the experiments we have made show that our algorithms perform better than the standard competitive algorithms for this problem.

List Update with Prediction

In this paper, we offer a learning framework in which the agent’s knowledge gaps are overcome through corrective feedback from a teacher whenever the agent explains its (incorrect) predictions. We test it in a low-resource scenario in visual processing, in which the agent must learn to recognize distinct types of toy trucks. The agent starts the learning process with no ontology about what types of trucks exist nor which parts they have, and a deficient model for recognizing those parts from visual data. The teacher’s feedback to the agent’s explanations addresses its lack of relevant knowledge in the ontology via a generic rule (e.g., “dump trucks have dumpers”), whereas an inaccurate part recognition is corrected by a deictic statement (e.g., “this is not a dumper”). The learner utilizes this feedback not only to improve its estimate of the hypothesis space of possible domain ontologies and probability distributions over them, but also uses those estimates to update its visual interpretation of the scene. Our experiments demonstrate that teacher-learner pairs utilizing explanations and corrections are more data-efficient than those without such a faculty.

Learning Visually Grounded Domain Ontologies via Embodied Conversation and Explanation

Multimodal learning with incomplete modality is practical and challenging. Recently, multimodal prompt-based methods that introduce learnable prompts for missing-modality scenarios have exhibited impressive performance. However, these methods face several unresolved limitations: (1) incomplete modalities provide restricted modal cues for task-specific inference; (2) dummy imputation for missing content causes information loss and introduces additional noise; and (3) static prompts are instance-agnostic, offering limited knowledge for instances with various modal conditions. To address these issues, we propose RAGPT, a novel Retrieval-AuGmented dynamic Prompt Tuning framework. Specifically, RAGPT comprises three key modules: the multi-channel retriever, which identifies similar instances through within-modality retrieval relevance; the missing modality generator, designed to recover missing information using retrieved contexts; and the context-aware prompter, which captures contextual knowledge from relevant instances and generates adaptive prompts to largely enhance the model’s robustness. The framework maintains a model-agnostic design, facilitating seamless integration with various prompt-based models. Extensive experiments conducted on real-world datasets demonstrate that RAGPT, with a mere 3\% of the trainable parameters, consistently outperforms all competitive baselines in handling incomplete modality problems.

Retrieval-Augmented Dynamic Prompt Tuning for Incomplete Multimodal Learning

Learned lossless image compression has achieved significant advancements in recent years. However, existing methods often rely on training amortized generative models on massive datasets, resulting in sub-optimal probability distribution estimation for specific testing images during encoding process.  To address this challenge, we explore the connection between the Minimum Description Length (MDL) principle and Parameter-Efficient Transfer Learning (PETL), leading to the development of a novel content-adaptive approach for learned lossless image compression, dubbed CALLIC. Specifically, we first propose a content-aware autoregressive self-attention mechanism by leveraging convolutional gating operations, termed Masked Gated ConvFormer (MGCF), and pretrain MGCF on training dataset. Cache then Crop Inference (CCI) is proposed to accelerate the coding process. During encoding, we decompose pretrained layers, including depth-wise convolutions, using low-rank matrices and then adapt the incremental weights on testing image by Rate-guided Progressive Fine-Tuning (RPFT). RPFT fine-tunes with gradually  increasing patches that are sorted in descending order by estimated entropy, optimizing learning process and reducing adaptation time. Extensive experiments across diverse datasets demonstrate that CALLIC sets a new state-of-the-art for learned lossless image compression.

CALLIC: Content Adaptive Learning for Lossless Image Compression

Dynamic Music Emotion Recognition (DMER) aims to predict the emotion of different moments in music, playing a crucial role in music information retrieval. The existing DMER methods struggle to capture long-term dependencies when dealing with sequence data, which limits their performance. Furthermore, these methods often overlook the influence of individual differences on emotion perception, even though everyone has their own personalized emotional perception in the real world. Motivated by these issues, we explore more effective sequence processing methods and introduce the Personalized DMER (PDMER) problem, which requires models to predict emotions that align with personalized perception. Specifically, we propose a Dual-Scale Attention-Based Meta-Learning (DSAML) method. This method fuses features from a dual-scale feature extractor and captures both short and long-term dependencies using a dual-scale attention transformer, improving the performance in traditional DMER. To achieve PDMER, we design a novel task construction strategy that divides tasks by annotators. Samples in a task are annotated by the same annotator, ensuring consistent perception. Leveraging this strategy alongside meta-learning, DSAML can predict personalized perception of emotions with just one personalized annotation sample. Our objective and subjective experiments demonstrate that our method can achieve state-of-the-art performance in both traditional DMER and PDMER.

Personalized Dynamic Music Emotion Recognition with Dual-Scale Attention-Based Meta-Learning

Compositional relational reasoning (CRR) is a hallmark of human intelligence, but we lack a clear understanding of whether and how existing transformer large language models (LLMs) can solve CRR tasks. To enable systematic exploration of the CRR capability of LLMs, we first propose a new synthetic benchmark called Generalized Associative Recall (GAR) by integrating and generalizing the essence of several tasks in mechanistic interpretability (MI) study in a unified framework. Evaluation shows that GAR is challenging enough for existing LLMs, revealing their fundamental deficiency in CRR. Meanwhile, it is easy enough for systematic MI study. Then, to understand how LLMs solve GAR tasks, we use attribution patching to discover the core circuits reused by Vicuna-33B across different tasks, and a set of vital attention heads. Intervention experiments show that the correct functioning of these heads significantly impacts task performance. Especially, we identify two classes of heads whose activations represent the abstract notion of true and false in GAR tasks respectively. They play fundamental roles in CRR across various models and tasks.

Benchmarking and Understanding Compositional Relational Reasoning of LLMs

While pruning methods effectively maintain model perfor-
mance without extra training costs, they often focus solely
on preserving crucial connections, overlooking the impact
of pruned weights on subsequent fine-tuning or distillation,
leading to inefficiencies. Moreover, most compression tech-
niques for generative models have been developed primarily
for GANs, tailored to specific architectures like StyleGAN,
and research into compressing Diffusion models has just be-
gun. Even more, these methods are often applicable only to
GANs or Diffusion models, highlighting the need for ap-
proaches that work across both model types. In this paper, we introduce Singular Value Scaling (SVS), a versatile technique for refining pruned weights, applicable to both model types. Our analysis reveals that pruned weights often exhibit dominant singular vectors, hindering fine-tuning efficiency and leading to suboptimal performance compared to random initialization. Our method enhances weight initialization by minimizing the disparities between singular values of pruned
weights, thereby improving the fine-tuning process. This approach not only guides the compressed model toward superior solutions but also significantly speeds up fine-tuning. Extensive experiments on StyleGAN2, StyleGAN3 and DDPM demonstrate that SVS improves compression performance across model types without additional training costs.

Singular Value Scaling: Efficient Generative Model Compression via Pruned Weights Refinement

This paper studies decentralized optimization over a compact submanifold within a communication network of $n$ nodes, where each node possesses a smooth non-convex local cost function, and the goal is to jointly minimize the sum of these local costs. We focus particularly on the online setting, where local data is processed in real-time as it streams in, without the need for full data storage. We propose a decentralized projected Riemannian stochastic recursive momentum (DPRSRM) method that employs local hybrid stochastic gradient estimators and uses the network to track the global gradient. DPRSRM achieves an oracle complexity of  $\mathcal{O}(\epsilon^{-\frac{3}{2}})$, outperforming existing methods that have at most $\mathcal{O}(\epsilon^{-2})$ complexity. Our method requires only $\mathcal{O}(1)$ gradient evaluations per iteration for each local node and does not require restarting with a large batch gradient.   Furthermore, we demonstrate the effectiveness of our proposed methods compared to state-of-the-art ones through numerical experiments on principal component analysis problems and low-rank matrix completion.

Decentralized Projected Riemannian Stochastic Recursive Momentum Method for Nonconvex Optimization

While Nash equilibria are guaranteed to exist, they may exhibit dense support, making them difficult to understand and execute in some applications. In this paper, we study $k$-sparse commitments in games where one player is restricted to mixed strategies with support size at most $k$. Finding $k$-sparse commitments is known to be computationally hard. We start by showing several structural properties of $k$-sparse solutions, including that the optimal support may vary dramatically as $k$ increases. These results suggest that naive greedy or double-oracle-based approaches are unlikely to yield practical algorithms. We then develop a simple approach based on mixed integer linear programs (MILPs) for zero-sum games, general-sum Stackelberg games, and various forms of structured sparsity. We also propose practical algorithms for cases where one or both players have large (i.e., practically innumerable) action sets, utilizing a combination of MILPs and incremental strategy generation. We evaluate our methods on synthetic and real-world scenarios based on security applications. In both settings, we observe that even for small support sizes, we can obtain more than $90\%$ of the true Nash value while maintaining a reasonable runtime, demonstrating the significance of our formulation and algorithms.

Commitment to Sparse Strategies in Two-Player Games

REST APIs have become key components of web services. However, they often contain logic flaws resulting in server side errors or security vulnerabilities. HTTP requests are used as test cases to find and mitigate such issues. Existing methods to modify requests, including those using deep learning, suffer from limited performance and precision, relying on undirected search or making limited usage of the contextual information. In this paper we propose APIRL, a fully automated deep reinforcement learning tool for testing REST APIs. A key novelty of our approach is the use of feedback from a transformer moudle pre-trained on JSON-structured data, akin to that used in API responses. This allows APIRL to learn the subtleties relating to test outcomes, and generalise to unseen API endpoints. We show APIRL can find significantly more bugs than the state-of-the-art in real world REST APIs while minimising the number of required test cases. We also study how reward functions, and other key design choices, affect learnt policies in a thorough ablation study.

Downloads

Next from AAAI 2025

List Update with Prediction

Similar lecture

Enhancing mRNA Therapy Through Iterative Delivery

Stay up to date with the latest Underline news!

PRESENTATIONS

CONFERENCES

COMPANY

RESOURCES

.css-70qvj9{display:-webkit-box;display:-webkit-flex;display:-ms-flexbox;display:flex;-webkit-align-items:center;-webkit-box-align:center;-ms-flex-align:center;align-items:center;}Downloads

Next from AAAI 2025

List Update with Prediction

Similar lecture

Enhancing mRNA Therapy Through Iterative Delivery

Stay up to date with the latest Underline news!

PRESENTATIONS

CONFERENCES

COMPANY

RESOURCES

Downloads