logo
ProjectForthcoming

Sampling high dimensional measures with computational guarantees beyond convexity and smoothness

Location: Switzerland

Source: EU Funding & Tenders Portal

This research proposal aims to address key computational challenges in sampling high dimensional measures, with a focus on problems from statistical inference that lack the usual convexity and smoothness assumptions. Many statistical models present complex computational problems that require numerical integration of high dimensional measures which can be as challenging as those encountered in comp

Status
Prospective
Location
Switzerland
Updated
19 Nov 2026
Source
EU Funding & Tenders Portal

ConstructChat

Ask ConstructChat about Sampling high dimensional measures with computational guarantees beyond convexity and smoothness

Pick a question to edit it, or write your own.

First answer free · no account

I am a

Project Information FAQ

Project Information

3 Q
The project “Sampling high dimensional measures with computational guarantees beyond convexity and smoothness” is an infrastructure initiative, located in Switzerland. Taiyo aggregates data on it from EU Funding & Tenders Portal.

Participants

Not available for this record.

Status

Original status

forthcoming

Taiyo status

Prospective

Taiyo last update

2026-11-19

Contact

Not available for this record.

Description

Description

This research proposal aims to address key computational challenges in sampling high dimensional measures, with a focus on problems from statistical inference that lack the usual convexity and smoothness assumptions. Many statistical models present complex computational problems that require numerical integration of high dimensional measures which can be as challenging as those encountered in computer science and statistical physics, yet they remain poorly understood. This project develops MCMC algorithms and a quantitative mixing time theory in two main thrusts. First, we study sampling for polytope-constrained log-concave measures, typically arising in probit or censored regression, where the non-smoothness at boundary causes issue for Langevin-type algorithms. We design interior-point-method-inspired barrier functions tailored for sampling, refine Riemannian HMC analysis for implementable integrators, and develop instance-adaptive weighted Dikin/Vaidya/John-type walks to surpass worst-case analysis. Second, we take sparse PCA and Bayesian variable selection as canonical problems to study MCMC without log-concavity and with mixed-discrete-continuous parameters. Tuning signal-to-noise ratio (SNR) in these problems is known to make the computational problem from easy to hard. We aim to determine the optimal SNR threshold for MCMC to succeed efficiently and to resolve the open problem on whether MCMC are among the best algorithms in statistical problems with statistical-to-computational gaps, by leveraging recent progress on expander graphs, spectral independence, local-to-global approaches and stochastic localization. We further pursue a ``discrete KLS'' result on the Boolean hypercube, aiming for a new functional inequality framework with fewer checks than that in the state-of-the-art spectral independence framework.

Location

Country

Switzerland

Source

Source

EU Funding & Tenders Portal

URL

More Details

Record type

Project

Article published date

2026-10-01

More on this project

Research

Free account

View all details

You are reading the public part. A free account opens the rest:

  • Every detail on this project
  • News and media coverage
  • Technical research
View all details

Free account · no card · lands you back on this project