Abstract: It is common to use adjuvants in immunotherapeutic regimens to strengthen the immune response. However, multiple dosages are required making it inconvenient for the patient. Hydrogels have been proposed […]
Abstract: Earlier work has shown that similarity-based predictive models can improve upon predictive performance, as compared to using the entire training data to help build models, particular regarding model discrimination […]
Abstract: Modern machine learning is ultimately a simple process: We iteratively update the weights of machine learning models to minimize a problem-specific loss. When it works well, we deploy the […]
Abstract: Anderson Acceleration (AA) has been widely used to solve nonlinear fixed-point problems due to its rapid convergence. This talk focuses on a variant of AA in which multiple Picard […]
Abstract: Transparency is vital for efficiency in social systems, yet individuals with critical information often strategically postpone disclosure, even when required, to benefit themselves. To study this behavior, we introduce a multi-stage Chinese restaurant game with incomplete information that features system-recommended action rules and varying levels of player foresight. In our model, players initially receive […]
Abstract: The problem of classification in machine learning has often been approached in terms of function approximation. In this talk, we propose an alternative approach for classification in arbitrary compact metric spaces which, in theory, yields both the number of classes, and a perfect classification using a minimal number of queried labels. Our approach uses […]
Abstract: Modern machine learning and scientific computing pose optimization challenges of unprecedented scale and complexity, demanding fundamental advances in both theory and algorithmic design for nonconvex optimization. This talk presents […]
Abstract: The talk introduces a conjecture on the first exit time of fractional Brownian motion: the upper-tail probability for a fractional Brownian motion to first exit a positive-valued barrier over time […]
Abstract: A proper coloring of a graph is an assignment of colors from \( \{1, 2, \ldots, k\} \) to each node of a graph such that no two nodes […]
Abstract: Existing tools for explaining complex models and systems are associational rather than causal and do not provide mechanistic understanding. We propose a new notion called counterfactual explainability for causal attribution that is motivated by the concept of genetic heritability in twin studies. Counterfactual explainability extends methods for global sensitivity analysis (including the functional analysis […]
Abstract: We present a new approach for deriving structure-preserving numerical discretizations of Fokker-Planck equations by establishing a connection between the Fokker-Planck equation and its semi-discrete master equation at the level of the energy-dissipation law. We determine the transition rate in the master equation via the detailed balance condition and the spatial discretization of the continuous […]
Abstract: The Shapley value is a ubiquitous framework for attribution in machine learning, encompassing feature importance, data valuation, and causal inference. However, its exact computation is generally intractable, necessitating efficient approximation methods. While the most effective and popular estimators leverage the paired sampling heuristic to reduce estimation error, the theoretical mechanism driving this improvement has […]
