kolar
Chargers star Charlie Kolar calls out Ravens after getting revenge on old team with upset win
Miami Heat unveil Vice City court for'Grand Theft Auto VI'-themed clash with Milwaukee Bucks Legendary broadcaster Dan Hicks' death certificate reveals cause of tragic passing: report Madison Beer hasn't given up on the Chargers yet and was locked in from the red carpet during first win Sam Hartman's ex compares him to asparagus, Lane Kiffin plays dumb & thoughts on Kirk Herbstreit Lane Kiffin admits to waking up every hour with recurring nightmare of LSU's loss to Texas NBA star Jayson Tatum recalls reaction to surprise benching in the Olympics: 'Some fishy s---' Sophie Cunningham slams angry gamblers who flood her DMs after bets don't hit Dan Campbell won't stop players from celebrating even after star Aidan Hutchinson was injured celebrating Dan Dakich goes to bat for Indiana's Curt Cignetti after coach rips CFP selection committee Jerry Jones says discussions about replacing the Cowboys' embattled defensive coordinator are underway Tiger Woods' return to competitive golf coming at Hero World Challenge makes all the sense in the world Sen Daines warns against'knee-jerk' federal spending on FAA Will Cain: It's hard to believe this could all be a coincidence We've built an infrastructure on a'house of sand': Cybersecurity expert There will be attempts to'stop' AOC from running in 2028: Republican strategist'Mob Wives' star criticizes Zohran Mamdani over public safety: 'He's not my choice' Nick Wright on Chiefs offense, Ravens playoff hopes, 49ers favorites? Nick Wright joins Colin Cowherd to ask if the Kansas City Chiefs' offense is back on track, whether or not the Baltimore Ravens can make the playoffs without Lamar Jackson, and if the San Francisco 49ers deserve to be Super Bowl favorites. For Charlie Kolar, the Los Angeles Chargers' win over the Baltimore Ravens meant a little more. Kolar, 27, ran off the field after the Chargers' 23-20 win over the Ravens on Monday night at M&T Bank Stadium and had a message for his old team. I told them they should have paid me, Kolar said.
Adaptive Client Sampling in Federated Learning via Online Learning with Bandit Feedback
Zhao, Boxin, Wang, Lingxiao, Kolar, Mladen, Liu, Ziqi, Zhang, Zhiqiang, Zhou, Jun, Chen, Chaochao
Due to the high cost of communication, federated learning (FL) systems need to sample a subset of clients that are involved in each round of training. As a result, client sampling plays an important role in FL systems as it affects the convergence rate of optimization algorithms used to train machine learning models. Despite its importance, there is limited work on how to sample clients effectively. In this paper, we cast client sampling as an online learning task with bandit feedback, which we solve with an online stochastic mirror descent (OSMD) algorithm designed to minimize the sampling variance. We then theoretically show how our sampling method can improve the convergence speed of optimization algorithms. To handle the tuning parameters in OSMD that depend on the unknown problem parameters, we use the online ensemble method and doubling trick. We prove a dynamic regret bound relative to any sampling sequence. The regret bound depends on the total variation of the comparator sequence, which naturally captures the intrinsic difficulty of the problem. To the best of our knowledge, these theoretical contributions are new and the proof technique is of independent interest. Through both synthetic and real data experiments, we illustrate advantages of the proposed client sampling algorithm over the widely used uniform sampling and existing online learning based sampling strategies. The proposed adaptive sampling procedure is applicable beyond the FL problem studied here and can be used to improve the performance of stochastic optimization procedures such as stochastic gradient descent and stochastic coordinate descent.
FuDGE: Functional Differential Graph Estimation with fully and discretely observed curves
Zhao, Boxin, Wang, Y. Samuel, Kolar, Mladen
We consider the problem of estimating the difference between two functional undirected graphical models with shared structures. In many applications, data are naturally regarded as high-dimensional random function vectors rather than multivariate scalars. For example, electroencephalography (EEG) data are more appropriately treated as functions of time. In these problems, not only can the number of functions measured per sample be large, but each function is itself an infinite dimensional object, making estimation of model parameters challenging. In practice, curves are usually discretely observed, which makes graph structure recovery even more challenging. We formally characterize when two functional graphical models are comparable and propose a method that directly estimates the functional differential graph, which we term FuDGE. FuDGE avoids separate estimation of each graph, which allows for estimation in problems where individual graphs are dense, but their difference is sparse. We show that FuDGE consistently estimates the functional differential graph in a high-dimensional setting for both discretely observed and fully observed function paths. We illustrate finite sample properties of our method through simulation studies. In order to demonstrate the benefits of our method, we propose Joint Functional Graphical Lasso as a competitor, which is a generalization of the Joint Graphical Lasso. Finally, we apply our method to EEG data to uncover differences in functional brain connectivity between alcoholics and control subjects.
Post-Regularization Inference for Time-Varying Nonparanormal Graphical Models
Lu, Junwei, Kolar, Mladen, Liu, Han
We propose a novel class of time-varying nonparanormal graphical models, which allows us to model high dimensional heavy-tailed systems and the evolution of their latent network structures. Under this model, we develop statistical tests for presence of edges both locally at a fixed index value and globally over a range of values. The tests are developed for a high-dimensional regime, are robust to model selection mistakes and do not require commonly assumed minimum signal strength. The testing procedures are based on a high dimensional, debiasing-free moment estimator, which uses a novel kernel smoothed Kendall's tau correlation matrix as an input statistic. The estimator consistently estimates the latent inverse Pearson correlation matrix uniformly in both the index variable and kernel bandwidth. Its rate of convergence is shown to be minimax optimal. Our method is supported by thorough numerical simulations and an application to a neural imaging data set.
Estimating time-varying networks
Kolar, Mladen, Song, Le, Ahmed, Amr, Xing, Eric P.
Stochastic networks are a plausible representation of the relational information among entities in dynamic systems such as living cells or social communities. While there is a rich literature in estimating a static or temporally invariant network from observation data, little has been done toward estimating time-varying networks from time series of entity attributes. In this paper we present two new machine learning methods for estimating time-varying networks, which both build on a temporally smoothed $l_1$-regularized logistic regression formalism that can be cast as a standard convex-optimization problem and solved efficiently using generic solvers scalable to large networks. We report promising results on recovering simulated time-varying networks. For real data sets, we reverse engineer the latent sequence of temporally rewiring political networks between Senators from the US Senate voting records and the latent evolving regulatory networks underlying 588 genes across the life cycle of Drosophila melanogaster from the microarray time course.
Union Support Recovery in Multi-task Learning
Kolar, Mladen, Lafferty, John, Wasserman, Larry
We sharply characterize the performance of different penalization schemes for the problem of selecting the relevant variables in the multi-task setting. Previous work focuses on the regression problem where conditions on the design matrix complicate the analysis. A clearer and simpler picture emerges by studying the Normal means model. This model, often used in the field of statistics, is a simplified model that provides a laboratory for studying complex procedures.