58 problems
- 0 votes0 replies0 views
Matter-sector proximity scaling in the general case
Let be a closed Riemannian manifold with , let be a flat bundle class selected by the variational principle, and let…
- 0 votes0 replies0 views
Assembly-index lower-bound conjecture for RKHS kernel complexity
Let be an object with assembly index , let be the minimal kernel distinguishing from its chemical precursors, and let be the reproducing-kernel Hi…
- 0 votes0 replies0 views
Discrete stable self-consistent kernel conjecture
Let be the space of kernels, let be the optimized path entropy for a kernel held fixed at , and let a self-consistent kernel be a fixed po…
- 0 votes0 replies1 view
Conjecture that weaker kernel singularities yield faster convergence
Weaker-singularity convergence conjecture. Kernels with weaker singularities should converge more rapidly.
- 0 votes0 replies1 view
Boundary-condition characterization of power spaces for kernel methods
Let denote the power space associated with the kernel , where , and let be the Sobolev smoothness param…
- 0 votes0 replies0 views
NP-hardness conjecture for kernel discrepancy subset selection
Kernel discrepancy subset-selection complexity conjecture. The subset selection problem is NP-hard.
- 0 votes0 replies0 views
Iterated Tikhonov extension conjecture for KRAS estimators
Let KRAS denote the kernel adversarial estimator, and consider the source conditions imposed in the paper. An iterated Tikhonov KRAS estimator is obtained by applying Tikhonov regu…
- 0 votes0 replies0 views
Adaptive iterated Tikhonov conjecture for KRAS estimators
Let an adaptive iterated KRAS estimator be an iterated Tikhonov KRAS estimator whose regularization or stopping choice is selected adaptively, as in the adaptive LRAS procedure dis…
- 0 votes0 replies0 views
Iterated Tikhonov analysis conjecture for KRAS estimators
Let be a positive integer, and let a -iterated Tikhonov KRAS estimator mean the KRAS estimator obtained by applying Tikhonov regularization for iterations. Let Assumptio…
- 0 votes0 replies1 view
The intrinsic ill-posedness conjecture for KRAS estimators
Let KRAS denote the kernel adversarial estimator, and consider the finite-sample setting and source-condition assumptions described in the paper. The estimator may be penalized usi…
- 0 votes0 replies0 views
Finite-sample consistency conjecture for empirical kernel quantile embeddings with p greater than 1
Let , let have a density, and let and be measures on with densities bounded away from zero, satisfying…
- 0 votes0 replies2 views
Extension of RFM theory to multi-index models
Let be the modified Recursive Feature Machines algorithm that draws fresh samples and reweights the data using an average of the Average Gradient Outer Produ…
- 0 votes0 replies1 view
Extension of the Gaussian-data consistency theorem to all polynomial orders
Let , and consider Gaussian data in the regime with . Let be the kernel ridge regression prediction function with regula…
- 0 votes0 replies0 views
Kernel-basis approximation conjecture for independent-marginal distributions
Kernel-basis approximation conjecture. The choice of kernel functions as basis functions can be very useful for the -dimensional space of Gibbs distributions to accurately appro…
- 0 votes0 replies0 views
The saturation conjecture for kernel ridge regression
Let denote the source smoothness parameter, let be the eigenvalue-decay parameter, and let be the sample size. Kernel ridge regression (KRR) is tuned through its…
- 0 votes0 replies0 views
The zero-bandwidth limit of the kernelized Wasserstein gradient flow
Zero-bandwidth limit conjecture. In this limit, the kernelized Wasserstein gradient-flow equation
- 0 votes0 replies0 views
Conjecture on extending kernel linearization to smooth kernels
Let Proposition denote the paper's linearization result for finite-degree polynomial kernels with positive Taylor coefficients. Smooth-kernel extension conjecture. Methods similar…
- 0 votes0 replies0 views
Bietti et al.'s feature-learning rate conjecture
Let be the input dimension and the layer width, as in the stated feature-learning bound, whose approximation term contains the factor . Bietti et al.'s feature-…
- 0 votes0 replies0 views
KODE's kernel sufficiency conjecture for difficult HEPMASS matching
KODE's kernel sufficiency conjecture. This problem is difficult for KODE because the MMD between the reference and target samples is very small and the chosen kernel is not suf…
- 0 votes0 replies0 views
Regularisation tuning for improved KME-Dynamics filtering
In a filtering experiment, KME-Dynamics is compared with the Ensemble Kalman Filter and a Kalman-adjusted KME-Dynamics method. The KME-Dynamics inference step involves a linear inv…
- 0 votes0 replies0 views
Noise-assisted mitigation of mode-splitting difficulties in KME-Dynamics
The KME-Dynamics method is applied to transport probability distributions, including a Gaussian-to-mixture example in which splitting probability mass presents challenges. A noise…
- 0 votes0 replies0 views
Conjecture on the assumptions of part (i) for the Laplacian and Matérn kernels
Laplacian and Matérn kernel conjecture. The assumptions of part (i) are also true for the Laplacian and Matérn kernels when .
- 0 votes0 replies0 views
Minimum eigenvalue bound for Matérn kernel matrices
Let be the kernel matrix associated with a Matérn-type kernel , and let denote its smallest singular value. Let be the re…
- 0 votes0 replies0 views
Extension of time-varying bandits to dynamic optimization
The time-varying bandit setting concerns sequential optimization problems in which the objective or reward function may change over time. Time-varying bandit extension conjecture.…
- 0 votes0 replies0 views
Conjecture on the effect of small-bandwidth spike inaccuracy on neural-network test error
For inputs of order one, let denote the bandwidth parameter of the Gaussian spike, and consider the inaccuracy of the sine approximation to the Gaussian neural tangent ker…