New method estimates log-determinant using trace powers, avoiding classical limitations.
problem Estimating log-determinant of large matrices efficiently and accurately.
method Interpolating moment-generating function and its derivative at zero using trace powers.
result No continuous estimator using finite moments can be uniformly accurate over unbounded conditioning.
Trace norm regularization is a popular method of multitask learning. We give excess risk bounds with explicit dependence on the number of tasks, the number of examples per task and properties of the data distribution. The bounds are independent of the dimension of the input space, which may be infinite as in the case o…
Sharp inequalities in unit ball with constraints on moments.
problem Establishing Sobolev trace inequalities with constraints.
method Constructing smooth test functions for higher order moments.
result Almost optimal Sobolev trace inequalities for 2nd and 4th orders.
We prove trace identities for commutators of operators, which are used to derive sum rules and sharp universal bounds for the eigenvalues of periodic Schroedinger operators and Schroedinger operators on immersed manifolds. In particular, we prove bounds on the eigenvalue lambda_{N+1} in terms of the lower spectrum, bou…
Deform moment map on symplectic connections using star product algebras.
problem Understanding symplectic connections and their deformations.
method Study vector bundle of Fedosov star product algebras, formal connection, curvature, and star product trace.
result Showed star product trace as a formal symplectic form and moment map.
Study resolvent convergence for random matrices with general covariance profiles.
problem Analyzing resolvent convergence for random matrices with non-identically distributed columns.
method Using moments of quadratic forms and deterministic equivalents, the study provides bounds on the trace of matrix products.
result The trace of matrix products is close to the trace of a deterministic equivalent, controlled by matrix norms.
We prove optimal subspace embedding conjecture up to sub-polylogarithmic factors.
problem Optimal dimension and sparsity of subspace embeddings.
method Iterative decoupling technique to analyze higher-order trace moment bounds.
result Sub-polylogarithmic factors in dimension and sparsity of subspace embeddings.
The scalable calculation of matrix determinants has been a bottleneck to the widespread application of many machine learning methods such as determinantal point processes, Gaussian processes, generalised Markov random fields, graph models and many others. In this work, we estimate log determinants under the framework o…
In this paper, we prove the Bounded Height Conjecture which the author formulated in [2]. As a corollary, it follows that there are only a finite number of hyperbolic three manifolds of bounded volume and trace field degree.
Classifies knot traces with specific trisection genus limits.
problem Classifying knot traces with specific trisection genus limits.
method Classifying knot traces with specific trisection genus limits.
result Infinitely many knots have traces with trisection genus 3 and 4, and arbitrarily large trisection genus.
This paper identifies and bounds ICE central moments using PO marginal central moments.
problem Identifying and characterizing treatment effect heterogeneity.
method Using only marginal central moments of potential outcomes, the paper identifies and bounds central moments of individual causal effects.
result Identification and bounding of central moments of ICE using marginal moments of POs.
New bounds on machine learning model generalization error moments.
problem Understanding the performance of machine learning models.
method Information-theoretic bounds on the moments of the generalization error of learning algorithms.
result Proposed bounds on generalization error moments and their high-probability bounds.
This work improves trace norm regularization for multi-task learning with limited data.
problem Learning from few samples across multiple tasks.
method Trace norm regularization for a linear shared representation model.
result First estimation error bound for trace norm regularized estimator with scarce data.
The paper improves PAC-Bayes bounds for losses with finite moments.
problem Bounding generalization for losses with heavy tails and finite moments.
method Truncation method and PAC-Bayes bounds for unbounded losses with heavy tails and bounded variance.
result Bounds interpolate between slow and fast rates depending on the moment.
This paper examines how data affects risk measures in uncertain distributions.
problem How does distributional ambiguity affect risk measures?
method Formulated and derived simpler dual problems for infinite and finite dimensional robust moment problems.
result Developed theory and conducted experiments in inventory control and portfolio management.
Estimates matrix trace optimization with statistical learning theory.
problem Optimizing trace of parameter-dependent matrices.
method Monte Carlo estimator with bounds derived from epsilon nets and generic chaining.
result Predicts small sampling amount for matrices with small off-diagonal mass.
Let O be a symplectic toric 2n-dimensional orbifold with a fixed T^n-action and with a toric Kahler metric g. We previously explored whether, when O is a manifold, the equivariant spectrum of the Laplace operator acting on smooth functions on (O,g) determines the moment polytope of O, and hence by Delzant's theorem det…
New bounds on generalization error using information density moments.
problem Bounding the generalization error of randomized learning algorithms.
method Derives bounds on average and tail probabilities of generalization error using mth central moments of the information density.
result Explicit bounds on generalization error are derived, showing better dependence on confidence level with higher-order information density moments.
We show how to compute lower bounds for the supremum Bayes error if the class-conditional distributions must satisfy moment constraints, where the supremum is with respect to the unknown class-conditional distributions. Our approach makes use of Curto and Fialkow's solutions for the truncated moment problem. The lower …
A semicontinuous semifinite trace is constructed on the C*-algebra generated by the finite propagation operators acting on the L^2-sections of a hermitian vector bundle on an amenable open manifold of bounded geometry. This trace is the semicontinuous regularization of a functional already considered by J. Roe. As an a…
Study differentially private linear regression with heavy-tailed data.
problem Differentially private ℓ1-norm linear regression with heavy-tailed data. method Exponential mechanism for ℓ2-norm bounded second moment; relaxation to ℓ2-norm bounded θ-th moment; coordinate-wise bounded moments. result Achieved upper bounds for privacy-preserving linear regression under various moment conditions.
Obstructions found for closed Fedosov star products on symplectic and Kähler manifolds.
problem Existence of closed Fedosov star products on symplectic and Kähler manifolds.
method Normalized trace of Fedosov star product, cohomology classes, and formal 2-forms.
result Integral invariants attached to symplectic and Kähler manifolds as obstructions to closed Fedosov star products.
Study trace systoles on surfaces, finding optimal bounds and implications.
problem Optimal systolic inequalities on hyperbolic manifolds and non-Fuchsian representations.
method Defined trace systole, used Markoff maps correspondence, computed bounds.
result Explicit optimal bounds for one-holed torus, four-holed sphere, and non-orientable surface of genus 3.
The paper examines higher moments in insurance, focusing on coskewness and its impact on actuarial quantities.
problem The impact of higher-order moments on actuarial applications, particularly expected shortfall and life annuity valuation.
method Derives analytical bounds for mixed moments under unspecified dependence structure, applies copula-based mixture model.
result Coskewness and odd-order mixed moments exhibit a monotonic relationship with expected shortfall and annuity premiums.
Study the Bochner-Schrödinger operator's trace in semiclassical limit.
problem Trace formula for Bochner-Schrödinger operator on tensor powers of line and vector bundles.
method Semiclassical analysis of the Bochner-Schrödinger operator Hp on tensor powers of a Hermitian line bundle and vector bundle. result Complete asymptotic expansion of the trace of φ(Hp) in the semiclassical limit po∞. Develops hypothesis tests for conditional distributions using learning-theoretic bounds.
problem Testing differences in conditional distributions and functionals.
method Transforming learning-theoretic bounds into hypothesis tests for conditional expectations.
result Establishes comprehensive foundation for conditional testing, including theoretical guarantees and practical implementations.
Bounds on spectral gaps of hyperbolic 3-manifolds and orbifolds.
problem Constraining the spectra of Laplace operators on hyperbolic manifolds and orbifolds.
method Linear programming and spectral identities derived from the conformal bootstrap and Selberg trace formula.
result Upper bounds on the first and second Laplacian eigenvalues, and spectral gaps of hyperbolic 3-manifolds and orbifolds.
For a single cusped hyperbolic 3-manifold, Hodgson proved that there are only finitely many Dehn fillings of it whose trace fields have bounded degree. In this paper, we conjecture the same for manifolds with more cusps, and give the first positive results in this direction. For example, in the 2-cusped case, if a mani…
The paper improves generalization bounds for domain adaptation.
problem Improving generalization bounds for domain adaptation under practical conditions.
method Derives generalization bounds for domain adaptation based on finitely many moments and smoothness conditions.
result Obtains generalization bounds for domain adaptation.
Ancient Ricci flows with nonnegative curvature operator have bounded entropy.
problem Conditions for bounded entropy in ancient Ricci flows.
method Used Perelman's entropy and Hamilton's trace Harnack inequality.
result Curvature operator nonnegativity is not necessary for bounded entropy.
We show that the moment explosion time in the rough Heston model [El Euch, Rosenbaum 2016, arxiv:1609.02108] is finite if and only if it is finite for the classical Heston model. Upper and lower bounds for the explosion time are established, as well as an algorithm to compute the explosion time (under some restrictions…
TRACE analyzes risk changes in models trained on shifted data.
problem Understanding performance changes when a model trained on shifted data is used.
method TRACE framework decomposes risk change into four factors: generalization gaps, model change penalty, and covariate shift penalty.
result TRACE provides a diagnostic tool to understand and quantify risk changes due to covariate shift.
We consider the dynamics of a linear stochastic approximation algorithm driven by Markovian noise, and derive finite-time bounds on the moments of the error, i.e., deviation of the output of the algorithm from the equilibrium point of an associated ordinary differential equation (ODE). We obtain finite-time bounds on t…
Uniform deviation bounds limit the difference between a model's expected loss and its loss on an empirical sample uniformly for all models in a learning problem. As such, they are a critical component to empirical risk minimization. In this paper, we provide a novel framework to obtain uniform deviation bounds for loss…
GL-LowPopArt improves minimax-optimal estimation for trace regression.
problem Minimizing estimation error in generalized low-rank trace regression.
method Two-stage approach: nuclear norm regularization followed by matrix Catoni estimation.
result Achieves instance-wise optimal error bounds up to condition number.
Revisits Lee's Moment Formula, relaxing moment assumptions for implied volatility.
problem Implied volatility constraints under finite log-moments.
method Analyzes stock price martingale with finite log-moments, derives new bounds and proof.
result New bounds on implied volatility growth, relaxes moment assumptions.
The Schatten quasi-norm was introduced to bridge the gap between the trace norm and rank function. However, existing algorithms are too slow or even impractical for large-scale problems. Motivated by the equivalence relation between the trace norm and its bilinear spectral penalty, we define two tractable Schatten norm…
The wave trace of certain convex domains can be smooth near some points in the length spectrum.
problem Understanding the relationship between the wave trace and the length spectrum of convex domains.
method Constructing silent periodic billiard orbits with the same length but different Maslov indices, using a microlocal parametrix for wave invariants.
result The wave trace can be smooth near some points in the length spectrum, showing potential limitations for inverse spectral problems.
This thesis studies domain adaptation under minimal distribution similarity assumptions using moments.
problem Learning from samples with distributions different from training samples.
method Uses minimal similarity assumptions modeled by moments.
result Establishes learning bounds and algorithms for domain adaptation.
Our main result is that for all sufficiently large x0>0, the set of commensurability classes of arithmetic hyperbolic 2- or 3-orbifolds with fixed invariant trace field k and systole bounded below by x0 has density one within the set of all commensurability classes of arithmetic hyperbolic 2- or 3-orbifolds wit…
The paper sets limits on the accuracy of macroeconomic forecasts based on statistical moments and trade volumes.
problem Uncertainty in predicting macroeconomic variables like prices and returns.
method Defines theoretical lower bounds of uncertainty and upper limits on forecast accuracy based on statistical moments and trade volumes.
result Accuracy of forecasts of probabilities of macroeconomic variables doesn't exceed Gaussian approximations.
Paper tackles moment estimation under covariate shift with a two-stage algorithm.
problem Estimating moments under covariate shift when source and target distributions differ.
method Proposes a two-stage algorithm: first, an optimal estimator for the source distribution; second, likelihood ratio reweighting for calibration.
result Achieves minimax optimal bound for moment estimation.
Paper develops DP methods for low-rank matrix estimation with near-optimal performance.
problem Estimating a low-rank matrix under differential privacy constraints.
method Introduced computationally efficient DP-initialization and Riemannian optimization-based DP-RGrad algorithm.
result DP-RGrad achieves near-optimal convergence rate under weak differential privacy constraints.
We prove explicit upper and lower bounds for the L1-moment spectra for the Brownian motion exit time from extrinsic metric balls of submanifolds Pm in ambient Riemannian spaces Nn. We assume that P and N both have controlled radial curvatures (mean curvature and sectional curvature, respectively) as view…
We present a number of related comparison results, which allow to compare moment explosion times, moment generating functions and critical moments between rough and non-rough Heston models of stochastic volatility. All results are based on a comparison principle for certain non-linear Volterra integral equations. Our u…
PMT uses public data moments to make DP feasible for unbounded data.
problem Applying differential privacy to unbounded data distributions.
method Public-moment-guided Truncation (PMT) using second-moments from public data.
result PMT improves the accuracy and stability of DP models.
Improved bounds on moments of word measures on unitary groups.
problem Analyzing the moments of word measures on unitary groups.
method Using Haar-uniform sampling and algebraic invariants to study asymptotic behavior.
result Found a new algebraic invariant related to the moments of word measures.
Method calculates systolic length of modular curves.
problem Computing upper bounds on systolic length of Riemann surfaces.
method Using congruence subgroups of hyperbolic triangle groups and traces of generators.
result Systolic length grows logarithmically with genus.