English
Related papers

Related papers: Estimating Ising Models in Total Variation Distanc…

200 papers

A spin-$s$ variable-range interacting Ising model may display qualitatively different behaviors depending on the fall-off rate of the interactions, as already seen in equilibrium studies of spin-1/2 systems. We propose a dynamical method…

Quantum Physics · Physics 2026-02-10 Keshav Das Agarwal , Debkanta Ghosh , Pritam Halder , Aditi Sen De

Estimating a constrained relation is a fundamental problem in machine learning. Special cases are classification (the problem of estimating a map from a set of to-be-classified elements to a set of labels), clustering (the problem of…

Machine Learning · Computer Science 2014-08-06 Lizhen Qu , Bjoern Andres

Consider the nonparametric logistic regression problem. In the logistic regression, we usually consider the maximum likelihood estimator, and the excess risk is the expectation of the Kullback-Leibler (KL) divergence between the true and…

Statistics Theory · Mathematics 2025-02-26 Atsutomo Yara , Yoshikazu Terada

Linear time-invariant systems are very popular models in system theory and applications. A fundamental problem in system identification that remains rather unaddressed in extant literature is to leverage commonalities amongst related linear…

Machine Learning · Statistics 2024-01-03 Aditya Modi , Mohamad Kazem Shirani Faradonbeh , Ambuj Tewari , George Michailidis

In this paper, we consider the meta learning problem for estimating the graphs associated with high-dimensional Ising models, using the method of $\ell_1$-regularized logistic regression for neighborhood selection of each node. Our goal is…

Machine Learning · Computer Science 2022-08-23 Huiming Xie , Jean Honorio

We study three fundamental statistical-learning problems: distribution estimation, property estimation, and property testing. We establish the profile maximum likelihood (PML) estimator as the first unified sample-optimal approach to a wide…

Machine Learning · Statistics 2019-07-12 Yi Hao , Alon Orlitsky

The integration of discrete algorithmic components in deep learning architectures has numerous applications. Recently, Implicit Maximum Likelihood Estimation (IMLE, Niepert, Minervini, and Franceschi 2021), a class of gradient estimators…

Machine Learning · Computer Science 2023-02-07 Pasquale Minervini , Luca Franceschi , Mathias Niepert

Total variation (TV) minimization is one of the most important techniques in modern signal/image processing, and has wide range of applications. While there are numerous recent works on the restoration guarantee of the TV minimization in…

Analysis of PDEs · Mathematics 2022-07-18 Jian-Feng Cai , Jae Kyu Choi , Ke Wei

Data-driven individualized decision making has recently received increasing research interests. Most existing methods rely on the assumption of no unmeasured confounding, which unfortunately cannot be ensured in practice especially in…

Methodology · Statistics 2022-12-26 Zhengling Qi , Rui Miao , Xiaoke Zhang

Approximate inference in probability models is a fundamental task in machine learning. Approximate inference provides powerful tools to Bayesian reasoning, decision making, and Bayesian deep learning. The main goal is to estimate the…

Machine Learning · Computer Science 2020-03-10 Jun Han

Many nonlinear time series models have been proposed in the last decades. Among them, the models with regime switchings provide a class of versatile and interpretable models which have received a particular attention in the literature. In…

Applications · Statistics 2014-05-20 Pierre Ailliot , Francoise Pene

Hidden Markov models have successfully been applied as models of discrete time series in many fields. Often, when applied in practice, the parameters of these models have to be estimated. The currently predominating identification methods,…

Machine Learning · Statistics 2015-07-24 Robert Mattila , Cristian R. Rojas , Bo Wahlberg

This paper explores unsupervised learning of parsing models along two directions. First, which models are identifiable from infinite data? We use a general technique for numerically checking identifiability based on the rank of a Jacobian…

Machine Learning · Statistics 2012-06-15 Daniel Hsu , Sham M. Kakade , Percy Liang

Distances are pervasive in machine learning. They serve as similarity measures, loss functions, and learning targets; it is said that a good distance measure solves a task. When defining distances, the triangle inequality has proven to be a…

Machine Learning · Computer Science 2020-07-08 Silviu Pitis , Harris Chan , Kiarash Jamali , Jimmy Ba

We study mixed models with a single grouping factor, where inference about unknown parameters requires optimizing a marginal likelihood defined by an intractable integral. Low-dimensional numerical integration techniques are regularly used…

Methodology · Statistics 2025-01-22 Alex Stringer , Blair Bilodeau , Yanbo Tang

We consider testing for the parameters of Ferromagnetic Ising models. While testing for the presence of possibly sparse magnetizations, we provide a general lower bound of minimax separation rates which yields sharp results in high…

Statistics Theory · Mathematics 2019-06-04 Rajarshi Mukherjee , Gourab Ray

Multi-objective optimisation problems involve finding solutions with varying trade-offs between multiple and often conflicting objectives. Ising machines are physical devices that aim to find the absolute or approximate ground states of an…

Artificial Intelligence · Computer Science 2023-05-22 Mayowa Ayodele , Richard Allmendinger , Manuel López-Ibáñez , Arnaud Liefooghe , Matthieu Parizy

Given samples from an unknown multivariate distribution $p$, is it possible to distinguish whether $p$ is the product of its marginals versus $p$ being far from every product distribution? Similarly, is it possible to distinguish whether…

Data Structures and Algorithms · Computer Science 2019-07-12 Constantinos Daskalakis , Nishanth Dikkala , Gautam Kamath

We present a new family of zero-field Ising models over N binary variables/spins obtained by consecutive "gluing" of planar and $O(1)$-sized components along with subsets of at most three vertices into a tree. The polynomial time algorithm…

Data Structures and Algorithms · Computer Science 2019-06-18 Valerii Likhosherstov , Yury Maximov , Michael Chertkov

Single Particle Tracking (SPT) can aid in understanding complex spatio-temporal processes. However, quantifying diffusivity and forces from individual live cell trajectories is complicated by inter- & intra-trajectory kinetic heterogeneity,…

Quantitative Methods · Quantitative Biology 2016-05-19 Christopher P. Calderon
‹ Prev 1 8 9 10 Next ›