Select a calendar:
Filter February Events by Event Type:
University Calendar
Events for February
-
PhD Thesis Proposal - Tingting Tang
Mon, Feb 03, 2025 @ 12:30 PM - 01:30 PM
Thomas Lord Department of Computer Science
University Calendar
Title: Optimizing Privacy-Preserving Machine Learning for Improved Privacy, Utility, and Efficiency Tradeoffs
Location: EEB 349
Date and Time: February 3, 2025, 12.30 PM-1.30 PM
Zoom Link: https://usc.zoom.us/j/7995244109?pwd=OUp6RWhUZlFGclgyN3hkREh0Z21ldz09
Committee: Murali Annavaram (Chair), Salman Avestimehr, Bhaskar Krishnamachari, Harsha Madhyastha, Sai Praneeth Karimireddy
Abstract: Privacy-preserving machine learning (PPML) is essential for protecting sensitive data in machine-learning applications, requiring a careful balance between privacy, utility, and efficiency. However, the trade-offs and interdependencies among these dimensions present significant design challenges. This thesis proposal explores and optimizes their interplay through low-rank decomposition, focusing on two key PPML technologies: Differential Privacy (DP) and Secure Multiparty Computation (MPC). In the context of DP-based graph neural networks (GNNs), I propose a novel training framework leveraging low-rank singular value perturbation to protect sensitive graph edges while preserving the primary graph structure. This approach achieves a significantly improved privacy-utility trade-off and demonstrates resilience to edge inference attacks. For MPC-based secure model inference, I propose leveraging low-rank decomposition for the linear layers of ML models, reducing the number of MPC multiplications required during offline and online phases. Techniques such as truncation skipping and linear layer concatenation further reduce computational and communication overheads, enhancing overall efficiency in MPC ML workflows without compromising the robust security guarantees provided by MPC. By addressing the interactions between privacy, utility, and efficiency, my proposal lays the foundation for more practical and effective deployment of privacy-preserving machine learning solutions in real-world applications.Location: Hughes Aircraft Electrical Engineering Center (EEB) - 349
Audiences: Everyone Is Invited
Contact: Tingting Tang
This event is open to all eligible individuals. USC Viterbi operates all of its activities consistent with the University's Notice of Non-Discrimination. Eligibility is not determined based on race, sex, ethnicity, sexual orientation, or any other prohibited factor.
-
PhD Dissertation Defense - Zihao He
Wed, Feb 05, 2025 @ 12:00 PM - 02:00 PM
Thomas Lord Department of Computer Science
University Calendar
Title: Aligning Large Language Models with Human Perspectives
Date & Time: Wednesday, February 5th - 12:00p - 2:00p
Location: RTH 306
Committee: Kristina Lerman (Chair, CS), Emilio Ferrara (CS), Marlon Twyman (Communication)
Abstract: Large Language Models (LLMs) are increasingly deployed in real-world applications. However, their ability to accurately represent diverse human perspectives remains a critical challenge. This thesis investigates LLM alignment, which refers to how closely these models reflect the ideologies, values, and communication styles of specific communities. First, I develop methods for aligning LLMs to online communities and introduce Community-Cross-Instruct, a framework that generates structured instruction-answer pairs to enhance fidelity and scalability. Second, I propose comprehensive evaluation frameworks to assess alignment beyond positional stances, including affective alignment (how well LLMs capture emotional and moral tones) and multidimensional evaluations across authenticity, toxicity, and harm. Finally, I explore ethical risks in alignment, demonstrating how minimal biased data during instruction tuning can shift an LLM’s behavior, raising concerns about ideological manipulation. These findings highlight the technical, evaluation, and ethical complexities of LLM alignment, providing a foundation for ensuring that LLMs reflect diverse human perspectives and stay robust to ideological manipulation.
Zoom Link: https://usc.zoom.us/j/97020518118?pwd=mZeDv2WhswDGTouNvvWFI9NFqhO5KR.1Location: Ronald Tutor Hall of Engineering (RTH) - 306
Audiences: Everyone Is Invited
Contact: Zihao He
This event is open to all eligible individuals. USC Viterbi operates all of its activities consistent with the University's Notice of Non-Discrimination. Eligibility is not determined based on race, sex, ethnicity, sexual orientation, or any other prohibited factor. -
PhD Thesis Proposal - Curtis Bechtel
Thu, Feb 20, 2025 @ 12:00 PM - 02:00 PM
Thomas Lord Department of Computer Science
University Calendar
Title: Incentivizing Efficient Delegation without Payments
Date and Time: Thursday, Feb 20, 2025 at 12:00pm
Location: Ginsburg Hall (GCS) 502C
Committee: Shaddin Dughmi (Chair), David Kempe, Shanghua Teng, Vatsal Sharan, Ruolin Li (external)
Abstract: In delegation problems, a principal wants to search through a stochastic space of feasible solutions for one maximizing their utility, but they lack the ability to conduct this search on their own. Instead, they must delegate this search problem to one or more untrusted agents with distinct utility functions. The principal is then faced with the problem of designing a mechanism that incentivizes agents to find and propose a solution maximizing their utility. Importantly, the principal's power is limited to announcing which feasible solutions they would accept or reject, so we don't allow the principal to offer direct transfers of value, either positive or negative, for any outcome. Despite this limitation, there often exist mechanisms under which the principal is guaranteed a constant-factor approximation of their first-best utility. In this work, we propose three broad approaches to modeling delegation problems that address different aspects of the problem: combinatorial search and solution constraints, additive costs for searching, and delegating to multiple agents. We then show how the principal can achieve competitive approximations for several variants of each of these approaches.Location: Ginsburg Hall (GCS) - 502C
Audiences: Everyone Is Invited
Contact: Curtis Bechtel
This event is open to all eligible individuals. USC Viterbi operates all of its activities consistent with the University's Notice of Non-Discrimination. Eligibility is not determined based on race, sex, ethnicity, sexual orientation, or any other prohibited factor.
