中文
相关论文

相关论文: Homomorphisms and Minimality for Enrich-by-Need Se…

200 篇论文

With the growing amount of personal information exchanged over the Internet, privacy is becoming more and more a concern for users. One of the key principles in protecting privacy is data minimisation. This principle requires that only the…

密码学与安全 · 计算机科学 2014-01-14 Meilof Veeningen , Benne de Weger , Nicola Zannone

Stochastic modelling provides an indispensable tool for understanding how random events at the molecular level influence cellular functions. In practice, the common challenge is to calibrate a large number of model parameters against the…

分子网络 · 定量生物学 2015-03-17 Shuohao Liao , Tomas Vejchodsky , Radek Erban

A model-theoretic approach can establish security theorems for cryptographic protocols. Formulas expressing authentication and non-disclosure properties of protocols have a special form. They are quantified implications for all xs . (phi…

密码学与安全 · 计算机科学 2009-11-12 Joshua Guttman

Pre-training Large Language Models (LLMs) on web-scale datasets becomes fundamental for advancing general-purpose AI. In contrast, enhancing their predictive performance on downstream tasks typically involves adapting their knowledge…

Personalizing Large Language Model (LLM) agents requires conditioning them on user-specific data, creating a critical trade-off between task utility and data disclosure. While the utility of adding user data often exhibits diminishing…

人工智能 · 计算机科学 2025-12-16 Daniel Platnick , Marjan Alirezaie , Hossein Rahnama

Principal component analysis (PCA) requires the computation of a low-rank approximation to a matrix containing the data being analyzed. In many applications of PCA, the best possible accuracy of any rank-deficient approximation is at most a…

统计计算 · 统计学 2010-06-04 Vladimir Rokhlin , Arthur Szlam , Mark Tygert

Current adversarial robustness methods for large language models require extensive datasets of harmful prompts (thousands to hundreds of thousands of examples), yet remain vulnerable to novel attack vectors and distributional shifts. We…

人工智能 · 计算机科学 2026-05-12 Linh Le , David Williams-King , Mohamed Amine Merzouk , Aton Kamanda , Adam Oberman

This paper addresses the design of a dedicated homophonic coding for a class of communication systems which, in order to provide both reliability and security, first encode the data before encrypting it, which is referred to as the…

密码学与安全 · 计算机科学 2015-03-17 Miodrag J. Mihaljevic , Frederique Oggier , Hideki Imai

This article describes a lightweight additive homomorphic algorithm with the same encryption and decryption keys. Compared to standard additive homomorphic algorithms like Paillier, this algorithm reduces the computational cost of…

密码学与安全 · 计算机科学 2024-04-03 Wuqiong Pan , Hongliang Gu

Homomorphic encryption is one of the main solutions for building secure and privacy-preserving solutions for Machine Learning as a Service. This motivates the development of homomorphic algorithms for the main building blocks of AI,…

密码学与安全 · 计算机科学 2024-10-16 Wonhee Cho , Guillaume Hanrot , Taeseong Kim , Minje Park , Damien Stehlé

Fine-tuning has become a popular approach to adapting large foundational models to specific tasks. As the size of models and datasets grows, parameter-efficient fine-tuning techniques are increasingly important. One of the most widely used…

As users increasingly interact with large language models (LLMs) using private information, secure and encrypted communication becomes essential. Homomorphic encryption (HE) provides a principled solution by enabling computation directly on…

机器学习 · 计算机科学 2025-10-15 Donghwan Rho , Sieun Seo , Hyewon Sung , Chohong Min , Ernest K. Ryu

Large language model (LLM) personalization aims to adapt general-purpose models to individual users. Most existing methods, however, are developed under data-rich and resource-abundant settings, often incurring privacy risks. In contrast,…

计算与语言 · 计算机科学 2026-01-13 Junho Park , Dohoon Kim , Taesup Moon

Conventional techniques for supervised classification constrain the classification rules considered and use surrogate losses for classification 0-1 loss. Favored families of classification rules are those that enjoy parametric…

机器学习 · 统计学 2019-06-03 Santiago Mazuelas , Andrea Zanoni , Aritz Perez

Large language model (LLM)-enhanced recommendation models inject LLM representations into backbone recommenders to exploit rich item text without inference-time LLM cost. However, we find that existing LLM-enhanced methods significantly…

信息检索 · 计算机科学 2026-04-23 Zhangchi Zhu , Wei Zhang

Proximal Policy Optimization (PPO) is a highly popular model-free reinforcement learning (RL) approach. However, we observe that in a continuous action space, PPO can prematurely shrink the exploration variance, which leads to slow progress…

机器学习 · 计算机科学 2020-11-04 Perttu Hämäläinen , Amin Babadi , Xiaoxiao Ma , Jaakko Lehtinen

Large Language Models (LLMs) have shown great potential in automatically generating and optimizing (meta)heuristics, making them valuable tools in heuristic optimization tasks. However, LLMs are generally inefficient when it comes to…

神经与进化计算 · 计算机科学 2025-05-23 Niki van Stein , Diederick Vermetten , Thomas Bäck

In systems design, we generally distinguish the architecture and the protocol levels. In the context of privacy by design, in the first case, we talk about privacy architectures, which define the privacy goals and the main features of the…

密码学与安全 · 计算机科学 2015-01-16 Vinh-Thong Ta , Thibaud Antignac

Adapting large language models (LLMs) to downstream tasks via full fine-tuning is increasingly impractical due to its computational and memory demands. Parameter-efficient fine-tuning (PEFT) approaches such as Low-Rank Adaptation (LoRA)…

机器学习 · 计算机科学 2026-05-19 Jing Gao , Zhong-Yi Lu , Pan Zhang , Ze-Feng Gao

Recent advances in cryptography promise to enable secure statistical computation on encrypted data, whereby a limited set of operations can be carried out without the need to first decrypt. We review these homomorphic encryption schemes in…

机器学习 · 统计学 2015-08-27 Louis J. M. Aslett , Pedro M. Esperança , Chris C. Holmes