Sharp bounds for curve isoperimetric deficit derived.
problem Finding sharp bounds for the isoperimetric deficit of curves.
method Fourier analysis applied to derive Wirtinger-type inequalities.
result Sharp lower and upper bounds for the isoperimetric deficit proved.
Sharp bounds on ATE with unmeasured confounders, valid even when misspecified.
problem Bounding average treatment effects with unmeasured confounders.
method Distributionally robust optimization, double sharpness, double validity.
result Proposes estimators with robustness properties for valid bounds.
Sharp bounds on Alexandrov spaces' boundaries with rigidity analysis.
problem Volume bounds on Alexandrov spaces' boundaries.
method Sharp volume bounds and rigidity analysis of Alexandrov spaces.
result New sharp volume bounds and classification of rigidity cases.
The study analyzes sharpness dynamics in neural networks, revealing mechanisms and conditions.
problem Understanding sharpness in neural network training.
method Fixed point analysis and edge of stability analysis in a simplified 2-layer linear network.
result Reveals mechanisms behind sharpness trends, conditions for edge of stability, and a period-doubling route to chaos.
Sharp analysis of out-of-distribution error in overparameterized models with importance weights.
problem Understanding and quantifying the degradation of performance in overparameterized models when faced with underrepresented data.
method Sharp analysis of an overparameterized Gaussian mixture model with spurious features and cost-sensitive interpolating solutions incorporating importance weights.
result Characterization of a novel tradeoff between worst-case robustness and average accuracy as a function of importance weight magnitude.
Sharp bounds for Dirichlet sums lead to improved Bayesian algorithm analysis.
problem Improving Bayesian algorithm performance through precise deviation bounds.
method Novel integral representation of Dirichlet sum density, Gaussian approximation, complex analysis.
result Significantly sharpened regret bounds for Multinomial Thompson Sampling.
A method to assess sensitivity to unmeasured confounding with sharp bounds.
problem Assessing the impact of unmeasured confounding on causal effects.
method Sets two intuitive parameters to estimate sensitivity intervals.
result Bounds on true causal effects can be tighter than existing methods.
Sharp-MAML improves MAML by reducing saddle points in few-shot learning.
problem Challenges in optimizing MAML due to complex loss landscape.
method Sharpness-aware minimization applied to MAML.
result Sharp-MAML and its variant outperform plain MAML on few-shot learning tasks.
Unified analysis improves SAM for non-convex optimization.
problem Improving generalization in machine learning models.
method Sharpness-aware minimization (SAM) and Unified SAM.
result Unified SAM provides convergence guarantees under relaxed assumptions.
We introduce and study the conical curvature-dimension condition, C C D ( K , N ) CCD(K,N) C C D ( K , N ) , for graphs. We show that C C D ( K , N ) CCD(K,N) C C D ( K , N ) provides necessary and sufficient conditions for the underlying graph to satisfy a sharp global Poincaré inequality which in turn translates to a sharp lower bound for the first eigenvalues of these graphs.…
SharpBalance improves deep ensemble performance by balancing sharpness and diversity.
problem Improving deep ensemble performance in both in-distribution and out-of-distribution scenarios.
method Introducing SharpBalance, a novel training approach that balances sharpness and diversity within ensembles.
result SharpBalance effectively improves the sharpness-diversity trade-off and ensemble performance in ID and OOD scenarios.
We provide a new theory for nodewise regression when the residuals from a fitted factor model are used. We apply our results to the analysis of the consistency of Sharpe ratio estimators when there are many assets in a portfolio. We allow for an increasing number of assets as well as time observations of the portfolio.…
DGSAM improves domain generalization by minimizing individual sharpness.
problem Improving domain generalization models that perform well on unseen target domains.
method Shifts DG paradigm toward minimizing individual sharpness across source domains.
result DGSAM reduces performance variance across domains with less computational overhead.
Sharp changes in time series representing market dynamics are studied by means of the self--similar analysis suggested earlier by the authors. These sharp changes are market booms and crashes. Such crises phenomena in markets are analogous to critical phenomena in physics. A simple classification of the market crisis p…
We consider the high-dimensional discriminant analysis problem. For this problem, different methods have been proposed and justified by establishing exact convergence rates for the classification risk, as well as the l2 convergence results to the discriminative rule. However, sharp theoretical analysis for the variable…
We complete the picture of sharp eigenvalue estimates for the p-Laplacian on a compact manifold by providing sharp estimates on the first nonzero eigenvalue of the nonlinear operator Δ p Δ_p Δ p when the Ricci curvature is bounded from below by a negative constant. We assume that the boundary of the manifold is convex, and p…
Researchers found the first and second eigenvalues are Courant-sharp on a Möbius strip.
problem Determining Courant-sharp eigenvalues on a Möbius strip.
method Analyzing the eigenvalues and nodal patterns of the Möbius strip.
result Only the first and second eigenvalues are Courant-sharp on the Möbius strip.
Sharp privacy bounds for sequential analysis of sensitive data.
problem Privacy degradation under sequential analysis of sensitive data.
method Edgeworth expansion in f-differential privacy framework.
result Improved privacy bounds under composition with refined approximation accuracy.
Sharp characterization of Willmore invariant in higher dimensions.
problem Understanding the Willmore invariant in various dimensions.
method Characterization using conformal fundamental forms and tensors.
result Sharp sufficient condition for vanishing Willmore invariant in even dimensions.
Paper uses LLMs for sector allocation, showing better returns.
problem Automated trading sector allocation inefficiencies.
method Systematic analysis of macroeconomic data and sentiment.
result LLM-based sector allocation outperforms traditional strategies.
Sharp analysis of power iteration for tensor PCA, improving convergence and stopping criteria.
problem Analyzing the power iteration algorithm for tensor PCA to improve convergence and stopping criteria.
method Sharp bounds on the number of iterations, revealing a smaller algorithmic threshold, proposing a stopping criterion.
result Sharp bounds on the number of iterations required for power method to converge, revealing a smaller algorithmic threshold than previously conjectured.
Sharp policy value estimation for contextual bandits with unobserved confounders.
problem Estimating policy value under unobserved confounders with sensitivity analysis.
method Kernel method to approximate conditional moment constraints, leveraging f-divergence.
result Sharp lower bound of policy value, avoiding coarse relaxation of uncertainty set.
A simple function shows how neural nets can converge despite high sharpness.
problem Understanding why neural nets converge with high sharpness.
method Constructed a minimal example function and analyzed its training dynamics rigorously.
result Final converging point has sharpness close to 2 / η 2/η 2/ η . Sharp inequalities and symmetries on Riemannian surfaces quantified.
problem Understanding symmetries and asymmetries in Riemannian surfaces.
method Introducing scattering energy to measure asymmetry and proving isoperimetric inequalities.
result Sharp quantitative isoperimetric inequalities and domains with vanishing scattering energy characterized.
Sharp curvature pinching for mean curvature flow in spheres proved.
problem Proving sharp curvature pinching for mean curvature flow in spheres.
method Using blow-up arguments, codimension and cylindrical estimates, and rescaling.
result Smooth convergence to a totally geodesic limit in infinite time.
We introduce a scalable measure of curvature for analyzing training dynamics of large language models.
problem Analyzing the training dynamics of large language models due to high computational cost of measuring Hessian sharpness.
method We introduce critical sharpness and relative critical sharpness as computationally efficient measures capturing Hessian sharpness phenomena.
result We provide the first demonstration of sharpness phenomena at scale up to 7B parameters.
Paper analyzes online tensorial ICA convergence with stochastic approximation.
problem Online tensorial ICA convergence analysis.
method Stochastic approximation for nonconvex optimization.
result Sharp finite-sample error bound of O ~ ( d / T ) \tilde{O}(\sqrt{d/T}) O ~ ( d / T ) . Sharp inequalities and extremals on compact Riemann surfaces with boundary.
problem Sharp Trudinger-Moser inequalities on compact Riemann surfaces with smooth boundary.
method Blow-up analysis involving isothermal coordinates.
result Existence of extremals and sharp inequalities.
Sharp inequalities on Siegel domains and complex hyperbolic spaces established.
problem Establishing inequalities on complex hyperbolic spaces and Siegel domains.
method Helgason-Fourier analysis, Kunze-Stein phenomenon, factorization theorem.
result Sharp Hardy-Adams and Adams type inequalities on Sobolev spaces of any positive fractional order on complex hyperbolic spaces.
Sharpness of actions on reductive homogeneous spaces proven for various groups.
problem Proving proper and cocompact actions on reductive homogeneous spaces.
method Using quasi-isometric embedding and Anosov representations.
result Characterization and proof of non-compactness for certain homogeneous spaces.
Study finds only first and second eigenvalues are Courant-sharp for flat Klein bottle and cylinders.
problem Determining Courant-sharp eigenvalues for compact flat surfaces.
method Analyzing flat Klein bottle and cylinders, proving only first and second eigenvalues are Courant-sharp.
result Only first and second eigenvalues are Courant-sharp for flat Klein bottle and cylinders.
Sharp large deviations and Gibbs conditioning for portfolio credit risk models.
problem Analyzing the risk of default in financial portfolios with dependent factors.
method Sharp large deviation estimates and conditional Bahadur-Rao estimates for threshold models with diverging latent factors.
result Conditioned on a large exceedance event, default indicators become asymptotically i.i.d., and loss-given-default is exponentially tilted.
The study examines MCMC methods for arbitrary objectives and finds likelihood sharpness impacts performance and regularization.
problem Limitations of MCMC methods for arbitrary objective functions.
method Two-block MCMC framework with Metropolis-Hastings and Gibbs sampling, exploring likelihood curvature and sharpness.
result Likelihood sharpness governs in-sample performance and regularization inferred by training data.
The paper uses PCA and HMM to forecast stock returns outperforming buy-and-hold.
problem Predicting stock returns accurately.
method Applied PCA to covariance matrix of S&P 500 stocks, used HMM on principal components, and forecasted stock returns.
result The model outperforms buy-and-hold strategy in terms of annualized Sharpe ratio.
Forward regression is a statistical model selection and estimation procedure which inductively selects covariates that add predictive power into a working statistical regression model. Once a model is selected, unknown regression parameters are estimated by least squares. This paper analyzes forward regression in high-…
EM algorithm converges linearly and achieves sharp rate in estimating mixtures of pairwise differences.
problem Estimating mixtures of pairwise differences from noisy data.
method Sharp analysis of the EM algorithm locally around the ground truth.
result The EM sequence converges linearly with an ℓ ∞ \ell_\infty ℓ ∞ -norm guarantee on the estimation error and achieves the sharp rate of estimation in the ℓ 2 \ell_2 ℓ 2 -norm. Hybrid approach combines Markowitz's theory with reinforcement learning for optimal portfolio management.
problem Optimizing investment portfolios while balancing returns and risks.
method Knowledge distillation for training reinforcement learning agents.
result Achieves highest yield and Sharpe ratio of 2.03, ensuring top profitability with low risk.
ES reduces high-probability regret in stochastic linear bandits.
problem High-probability regret in stochastic linear bandits.
method Linear ensemble sampling with standard Gaussian perturbations, analyzing m = Θ ( d log n ) m=Θ(d\log n) m = Θ ( d log n ) ensemble size. result ES achieves i l d e O ( d 3 / 2 n ) ilde O(d^{3/2}\sqrt n) i l d e O ( d 3/2 n ) high-probability regret, closing the gap to Thompson sampling. New AI platform screens portfolios for desirable firms and news.
problem Optimizing portfolio selection with AI.
method Two LLM agents screen for firm fundamentals and news sentiment. Agents deliberate to generate buy/sell signals. High-dimensional estimation determines optimal weights.
result Screened portfolio's Sharpe ratio consistently estimates target, superior to baseline and conventional approaches.
The paper introduces eigen-portfolios using PCA to improve portfolio construction in finance.
problem Overfitting and poor generalization in selecting a single eigen-portfolio.
method Principal Component Analysis (PCA) to derive eigen-portfolios from asset return correlation matrices.
result An ensemble strategy combining multiple top-performing eigen-portfolios significantly improves out-of-sample performance.
The purpose of this paper is to provide a sharp analysis on the asymptotic behavior of the Durbin-Watson statistic. We focus our attention on the first-order autoregressive process where the driven noise is also given by a first-order autoregressive process. We establish the almost sure convergence and the asymptotic n…
Sharp bounds on uniform generalization errors in binary linear classification.
problem Understanding the uniform generalization errors in binary linear classification.
method Isoperimetric arguments, Poincaré and log-Sobolev inequalities for joint distributions.
result Sharp concentration bounds on uniform generalization errors, almost sure convergence in broad settings.
Poly-GNNs achieve similar performance regardless of depth, highlighting graph noise's dominance.
problem Performance of poly-GNNs in semi-supervised node classification.
method Analysis of poly-GNNs under a contextual stochastic block model (CSBM).
result For a sufficiently large graph, depth k > 1 k > 1 k > 1 poly-GNNs exhibit the same rate of separation as depth k = 1 k=1 k = 1 counterparts. Sharp bounds derived for test error of finite-rank kernel ridge regression.
problem Loose bounds on test error for finite-rank kernels in machine learning.
method Sharp non-asymptotic upper and lower bounds for KRR test error.
result Tighter bounds on finite-rank KRR test error, valid for any regularization parameters.
Sharp bounds established for Federated Averaging (FedAvg), improving convergence rates.
problem Undetermined convergence rate of Federated Averaging (FedAvg) in Federated Learning.
method Developed novel iterate bias concept and proved sharp bounds on it, leading to improved convergence results.
result Lower bounds for FedAvg match existing upper bounds, showing no improvable capacity.
Sharp ABP estimate on metric spaces via optimal transport.
problem Sharp ABP estimate on metric measure spaces.
method Optimal transport theory.
result Established a sharp ABP estimate on metric measure spaces.
Sharp gradient estimate for scalar curvature on 3-manifolds.
problem Control the rate of change of scalar curvature on 3-manifolds.
method Using a regularized distance function and Green's function, derive a sharp gradient estimate.
result Average of gradient of regularized distance is ≤ 1 on 3-manifolds with nonnegative scalar curvature.
A guide to AI+ML for portfolio weight formation.
problem Optimizing portfolio weights using AI and ML techniques.
method Analysis of machine learning tools and their performance in portfolio weight formation.
result Nodewise regression with Global Minimum Variance portfolio weights deliver high Sharpe Ratios and returns.