BEGIN:VCALENDAR
VERSION:2.0
PRODID:-// - ECPv6.15.18//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://tilos.ai
X-WR-CALDESC:Events for 
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/Los_Angeles
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20250309T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20251102T090000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20260308T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20261101T090000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20270314T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20271107T090000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20260410T100000
DTEND;TZID=America/Los_Angeles:20260410T110000
DTSTAMP:20260403T141103
CREATED:20250923T164943Z
LAST-MODIFIED:20260326T182945Z
UID:7602-1775815200-1775818800@tilos.ai
SUMMARY:Optimization for ML and AI Seminar: A survey of the mixing times of the Proximal Sampler algorithm
DESCRIPTION:Andre Wibisono\, Yale University \nAbstract: Sampling is a fundamental algorithmic task with many connections to optimization. In this talk\, we survey a recent algorithm for sampling known as the Proximal Sampler\, which can be seen as a proximal discretization of the continuous-time Langevin dynamics\, and achieves the current state-of-the-art iteration complexity for sampling in discrete time. We survey the mixing time guarantees of the Proximal Sampler algorithm and show they match the guarantees for the Langevin dynamics. When the target distribution satisfies log-concavity or isoperimetry\, the Proximal Sampler has rapid convergence guarantees. We illustrate the proof technique via the strong data processing inequality along the Gaussian channel and its time reversal under isoperimetry. \n\nAndre Wibisono is an assistant professor in the Department of Computer Science at Yale University\, with a secondary appointment in the Department of Statistics & Data Science. His research interests are in the design and analysis of algorithms for machine learning\, in particular for problems in optimization\, sampling\, and game theory. He received his BS degrees in Mathematics and in Computer Science from MIT\, his MEng in Computer Science from MIT\, his MA in Statistics from UC Berkeley\, and his PhD in Computer Science from UC Berkeley. He has done postdoctoral research at the University of Wisconsin-Madison and at the Georgia Institute of Technology. \nZoom: https://bit.ly/Opt-AI-ML
URL:https://tilos.ai/event/optimization-for-ml-and-ai-seminar-a-survey-of-the-mixing-times-of-the-proximal-sampler-algorithm/
LOCATION:HDSI 123 and Virtual\, 3234 Matthews Ln\, La Jolla\, CA\, 92093\, United States
CATEGORIES:TILOS Seminar Series,TILOS Sponsored Event
ATTACH;FMTTYPE=image/jpeg:https://tilos.ai/wp-content/uploads/2025/09/wibisono-andre-e1758646059816.jpg
END:VEVENT
BEGIN:VEVENT
DTSTART;VALUE=DATE:20260427
DTEND;VALUE=DATE:20260428
DTSTAMP:20260403T141103
CREATED:20260121T215144Z
LAST-MODIFIED:20260402T165134Z
UID:8026-1777248000-1777334399@tilos.ai
SUMMARY:ICLR 2026 Workshop: Principled Design for Trustworthy AI - Interpretability\, Robustness\, and Safety across Modalities
DESCRIPTION:Modern AI systems\, particularly large language models\, vision-language models\, and deep vision networks\, are increasingly deployed in high-stakes settings such as healthcare\, autonomous driving\, and legal decisions. Yet\, their lack of transparency\, fragility to distributional shifts between train/test environments\, and representation misalignment in emerging tasks and data/feature modalities raise serious concerns about their trustworthiness. \nThis workshop focuses on developing trustworthy AI systems by principled design: models that are interpretable\, robust\, and aligned across the full lifecycle – from training and evaluation to inference-time behavior and deployment. We aim to unify efforts across modalities (language\, vision\, audio\, and time series) and across technical areas of trustworthiness spanning interpretability\, robustness\, uncertainty\, and safety.
URL:https://tilos.ai/event/iclr-2026-workshop-principled-design-for-trustworthy-ai-interpretability-robustness-and-safety-across-modalities/
LOCATION:ICLR 2026\, Riocentro Convention and Event Center\, Rio de Janiero\, Brazil
CATEGORIES:TILOS Sponsored Event,Workshop
ATTACH;FMTTYPE=image/jpeg:https://tilos.ai/wp-content/uploads/2026/01/rio.jpg
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20260506T110000
DTEND;TZID=America/Los_Angeles:20260506T120000
DTSTAMP:20260403T141103
CREATED:20251013T161935Z
LAST-MODIFIED:20251014T195232Z
UID:7644-1778065200-1778068800@tilos.ai
SUMMARY:TILOS-HDSI Seminar with Ellen Vitercik (Stanford)
DESCRIPTION:Title and abstract TBA… \n\nEllen Vitercik is an Assistant Professor at Stanford with a joint appointment between the Management Science and Engineering department and the Computer Science department. Her research interests include machine learning\, algorithm design\, discrete and combinatorial optimization\, and the interface between economics and computation. Before joining Stanford\, Dr. Vitercik was a Miller fellow at UC Berkeley\, hosted by Michael Jordan and Jennifer Chayes. She received a PhD in Computer Science from Carnegie Mellon University\, advised by Nina Balcan and Tuomas Sandholm. Dr. Vitercik has been recognized by a Schmidt Sciences AI2050 Early Career Fellowship and an NSF CAREER award. Her thesis won the SIGecom Doctoral Dissertation Award\, the CMU School of Computer Science Distinguished Dissertation Award\, and the Honorable Mention Victor Lesser Distinguished Dissertation Award. \nZoom: https://bit.ly/TILOS-Seminars
URL:https://tilos.ai/event/tilos-hdsi-seminar-with-ellen-vitercik-stanford/
LOCATION:HDSI 123 and Virtual\, 3234 Matthews Ln\, La Jolla\, CA\, 92093\, United States
CATEGORIES:TILOS Seminar Series
ATTACH;FMTTYPE=image/jpeg:https://tilos.ai/wp-content/uploads/2025/10/vitericik-ellen-e1760372346890.jpg
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20260513T110000
DTEND;TZID=America/Los_Angeles:20260513T120000
DTSTAMP:20260403T141103
CREATED:20260223T175317Z
LAST-MODIFIED:20260310T183326Z
UID:8092-1778670000-1778673600@tilos.ai
SUMMARY:TILOS-HDSI Seminar: ComPO: Preference Alignment via Comparison Oracles
DESCRIPTION:Tianyi Lin\, Columbia University \nDirect alignment methods are increasingly used for aligning large language models (LLMs) with human preferences. However\, these methods suffer from the likelihood displacement\, which can be driven by noisy preference pairs that induce similar likelihood for preferred and dis-preferred responses. To address this issue\, we consider doing derivative-free optimization based on comparison oracles. First\, we propose a new preference alignment method via comparison oracles and provide convergence guarantees for its basic mechanism. Second\, we improve our method using some heuristics and conduct the experiments to demonstrate the flexibility and compatibility of practical mechanisms in improving the performance of LLMs using noisy preference pairs. Evaluations are conducted across multiple base and instruction-tuned models with different benchmarks. Experimental results show the effectiveness of our method as an alternative to addressing the limitations of existing methods. A highlight of our work is that we evidence the importance of designing specialized methods for preference pairs with distinct likelihood margins. \n\nTianyi Lin is an assistant professor in the Department of Industrial Engineering and Operations Research (IEOR) at Columbia University. His research interests lie in generative artificial intelligence\, optimization for machine learning\, game theory\, social and economic network\, and optimal transport. He obtained his Ph.D. in Electrical Engineering and Computer Science at UC Berkeley\, where he was advised by Professor Michael Jordan and was associated with the Berkeley Artificial Intelligence Research (BAIR) group. From 2023 to 2024\, he was a postdoctoral researcher at the Laboratory for Information & Decision Systems (LIDS) at Massachusetts Institute of Technology\, working with Professor Asuman Ozdaglar. Prior to that\, he received a B.S. in Mathematics from Nanjing University\, a M.S. in Pure Mathematics and Statistics from University of Cambridge and a M.S. in Operations Research from UC Berkeley. \nZoom: https://bit.ly/TILOS-Seminars
URL:https://tilos.ai/event/tilos-hdsi-seminar-compo-preference-alignment-via-comparison-oracles/
LOCATION:HDSI 123 and Virtual\, 3234 Matthews Ln\, La Jolla\, CA\, 92093\, United States
CATEGORIES:TILOS Seminar Series
ATTACH;FMTTYPE=image/jpeg:https://tilos.ai/wp-content/uploads/2026/02/lin-tianyi-e1771869179855.jpeg
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20260520T110000
DTEND;TZID=America/Los_Angeles:20260520T120000
DTSTAMP:20260403T141103
CREATED:20260227T004426Z
LAST-MODIFIED:20260227T004426Z
UID:8112-1779274800-1779278400@tilos.ai
SUMMARY:TILOS-HDSI Seminar with Andrej Risteski (Carnegie Mellon)
DESCRIPTION:Title and abstract TBA… \n\nAndrej Risteski is an Associate Professor at the Machine Learning Department in Carnegie Mellon University. Prior to that\, he was a Norbert Wiener Research Fellow jointly in the Applied Math department and IDSS at MIT. Dr. Risteski received his PhD in the Computer Science Department at Princeton University under the advisement of Sanjeev Arora. \nDr. Risteski’s research interests lie in the intersection of machine learning\, statistics\, and theoretical computer science\, spanning topics like (probabilistic) generative models\, algorithmic tools for learning and inference\, representation and self-supervised learning\, out-of-distribution generalization and applications of neural approaches to natural language processing and scientific domains. The broad goal of his research is principled and mathematical understanding of statistical and algorithmic problems arising in modern machine learning paradigms. \nZoom: https://bit.ly/TILOS-Seminars
URL:https://tilos.ai/event/tilos-hdsi-seminar-with-andrej-risteski-carnegie-mellon/
LOCATION:HDSI 123 and Virtual\, 3234 Matthews Ln\, La Jolla\, CA\, 92093\, United States
CATEGORIES:TILOS Seminar Series
ATTACH;FMTTYPE=image/png:https://tilos.ai/wp-content/uploads/2026/02/risteski-andrej-e1772152946152.png
END:VEVENT
BEGIN:VEVENT
DTSTART;VALUE=DATE:20260603
DTEND;VALUE=DATE:20260604
DTSTAMP:20260403T141103
CREATED:20260224T210719Z
LAST-MODIFIED:20260324T200137Z
UID:8102-1780444800-1780531199@tilos.ai
SUMMARY:CVPR 2026 Workshop: Trustworthy\, Robust\, Uncertainty-Aware\, and Explainable Visual Intelligence and Beyond (TRUE-V)
DESCRIPTION:Contemporary vision models and vision–language models are increasingly deployed in high-stakes domains\, yet remain opaque\, fragile\, and difficult to align across tasks and modalities. This workshop aim to foster dialogue on the urgent need for transparent\, reliable\, and safe computer vision systems\, especially in critical domains such as healthcare\, transportation\, and legal decision making. It brings together research on interpretability\, robustness\, uncertainty\, and alignment under a unified design paradigm\, encouraging cross-disciplinary exchange on shared technical and societal challenges. By promoting responsible design and deployment\, the workshop seeks to advance forward-looking solutions for visual intelligence that enhance accountability and public trust.
URL:https://tilos.ai/event/cvpr-2026-workshop/
LOCATION:IEEE/CVF Conference on Computer Vision and Pattern Recognition\, Denver\, CO\, United States
CATEGORIES:TILOS Sponsored Event,Workshop
ATTACH;FMTTYPE=image/jpeg:https://tilos.ai/wp-content/uploads/2026/02/CVPR_Denver_2026.jpg
END:VEVENT
END:VCALENDAR