Using a new method we give elementary estimates for the capacity of non-contractible annuli on cylinders and provide examples, where these inequalities are sharp. Here the lower bound depends only on the area of the annulus. In the case of constant curvature this lower bound is obtained with the help of a symmetrizatio…
The paper extends a theorem about Kähler manifolds with quasi-negative curvature to almost quasi-negative curvature.
problem Understanding the ampleness of canonical line bundles for Kähler manifolds with specific curvature properties.
method Introducing a new notion of almost quasi-negative holomorphic sectional curvature and extending the theorem to this setting.
result The theorem is extended to compact Kähler manifolds with almost quasi-negative holomorphic sectional curvature, and a gap-type theorem is derived.
New method lowers spherical perceptron capacity using fully lifted random duality theory.
problem Tackles the negative spherical perceptron capacity, a long-standing open problem.
method Develops fully lifted random duality theory (fl RDT) to characterize capacity.
result Shows remarkable closed-form analytical relations for practical capacity values.
Symplectic fillings of prequantization bundles are shown to be disk bundles under certain conditions.
problem Characterizing symplectic fillings of prequantization bundles with finite capacities.
method Analysis of symplectic capacities and diffeomorphisms.
result Symplectic fillings of prequantization bundles are diffeomorphic to disk bundles under finite capacity conditions.
Derives new monotone quantities for p-harmonic functions on asymptotically flat 3-manifolds.
problem Estimating the mass of 3-manifolds with non-negative scalar curvature and minimal boundary.
method Derives monotone quantities for p-harmonic functions and applies them to derive a sharp mass-capacity estimate.
result Derives a sharp mass-capacity estimate relating the ADM mass of a 3-manifold to the p-capacity of its boundary.
First we review the definition of a negative point mass singularity. Then we examine the gravitational lensing effects of these singularities in isolation and with shear and convergence from continuous matter. We review the Inverse Mean Curvature Flow and use this flow to prove some new results about the mass of a sing…
Study on neural networks' storage capacity and solution space structure.
problem Understanding the storage capacity and solution space structure of neural networks.
method Replica method from statistical physics.
result Storage capacity per parameter remains finite even with infinite width and weights exhibit negative correlations.
We continue our study of the Complex Monge-Ampère Operator on the Weighted Pluricomplex energy classes. We give more characterizations of the range of the classes Eχ by the Complex Monge-Ampère Operator. In particular, we prove that a non-negative Borel measure μ is the Monge-Ampère of a unique function …
In this paper we combine one method for hierarchical reinforcement learning - the options framework - with deep Q-networks (DQNs) through the use of different "option heads" on the policy network, and a supervisory network for choosing between the different options. We utilise our setup to investigate the effects of ar…
The paper studies volume and area comparisons in non-compact 3-manifolds with non-negative scalar curvature.
problem Volume and area comparisons in non-compact 3-manifolds with non-negative scalar curvature.
method Gradient integral estimates and level set analysis.
result Sharp volume and area comparisons derived from a gradient integral estimate.
Estimates on Einstein manifolds improve Brownian motion behavior and curvature limits.
problem Improving estimates on Einstein manifolds for Brownian motion behavior.
method Generalizing Benjamini-Pemantle-Peres estimate to manifolds with Ricci curvature bounds.
result Sharp estimates for Brownian motion on high curvature parts of Ricci-flat manifolds.
A new PGA algorithm ensures stable, robust, and noise-immune solutions for non-negative inverse problems.
problem Stable convergence and suboptimal solutions in inverse problems due to negative values and high sensitivity to hyperparameters.
method A novel multiplicative update proximal gradient algorithm (SSO-PGA) that enforces non-negativity and boundedness through a learnable sigmoid-based operator.
result Significantly surpasses traditional PGA and other state-of-the-art algorithms in performance and stability.
ChatGPT predicts stock market reactions from news headlines without financial training.
problem Predicting stock price movements using non-financial data.
method Used post-knowledge-cutoff headlines to train ChatGPT-4, which forecasts stock market reactions.
result ChatGPT-4 can predict stock market reactions with high accuracy, especially for small stocks and negative news.
The paper proves a new inequality linking mass and volume in 3D space.
problem Relating mass and volume in 3D space with a sharp inequality.
method Using a monotonicity formula for level sets of a 3-harmonic function.
result Sharp lower bound for ADM mass in terms of Euclidean volume of Ω.
This study uses NLP to predict stock performance based on analyst reports.
problem Predicting stock performance using textual information from analyst reports.
method Natural language processing (NLP) and a customized BERT deep learning model for Chinese text.
result Strong positive sentiment in analyst reports increases excess return and intraday volatility, while strong negative sentiment increases volatility and trading volume but decreases excess return.
Word representation is fundamental in NLP tasks, because it is precisely from the coding of semantic closeness between words that it is possible to think of teaching a machine to understand text. Despite the spread of word embedding concepts, still few are the achievements in linguistic contexts other than English. In …
Wide neural networks can degrade performance, contrary to conventional wisdom.
problem Understanding the limitations of increasing network width in neural networks.
method Using Deep Gaussian Processes to decouple capacity and width, analyzing their effects on representational power and non-Gaussianity.
result Wide neural networks can become less adaptable and more Gaussian, leading to performance degradation.
We obtain in this paper bounds for the capacity of a compact set K. If K is contained in an (n+1)-dimensional Cartan-Hadamard manifold, has smooth boundary, and the principal curvatures of ∂K are larger than or equal to H0>0, then Cap(K)≥(n−1)H0vol(∂K). When K is contai…
FinTech negatively impacts Chinese banks' financial sustainability.
problem Impact of FinTech on financial sustainability of Chinese commercial banks.
method Three-stage network DEA-Malmquist model and two-way fixed effects model.
result FinTech primarily undermines financial sustainability by eroding loan efficiency and profitability.
We consider learning a convex combination of basis models, and present some new theoretical and empirical results that demonstrate the effectiveness of a greedy approach. Theoretically, we first consider whether we can use linear, instead of convex, combinations, and obtain generalization results similar to existing on…
Oil prices affect Russian banks' stability, with negative impacts from decreases.
problem The impact of international oil prices on Russian public banks' financial stability.
method Data from 17 Russian public banks (2008-2016), Pool Mean Group (PMG) estimator.
result An increase in international oil prices and price to book value ratio positively affects Russian public banks' stability in the long run, while negative shocks have the opposite effect.
App enhances midwives' skills in low-income countries.
problem Low-income countries have high maternal and child mortality rates.
method Deep learning models predict midwives' interest in learning materials.
result Deep learning models accurately predict midwives' interest in learning materials.
We study various capacities on compact Kähler manifolds which generalize the Bedford-Taylor Monge-Ampère capacity. We then use these capacities to study the existence and the regularity of solutions of complex Monge-Ampère equations.
Geometric theory of projection heads in self-supervised learning.
problem Dimensional collapse and information invariance trade-off in projection heads.
method Geometric modeling of projection heads as Riemannian metrics, analyzing Hessian eigenvalues, and tracking optimization geometry.
result Smooth nonlinear heads induce negative curvature, preventing collapse; linear and ReLU heads cannot.
Solves a discrete logarithmic Minkowski problem for electrostatic p-capacity.
problem Characterize measures generated by electrostatic p-capacity.
method Solves the discrete logarithmic Minkowski problem for 1 < p < n.
result Solves the discrete logarithmic Minkowski problem for measures in general position.
CapOptix uses options theory to price capacity in electricity markets.
problem Traditional capacity market designs fail to account for risk and price shocks.
method Interprets capacity commitments as reliability options and uses Markov Regime Switching Process.
result CapOptix provides more accurate pricing of capacity premia compared to existing mechanisms.
In this article, we propose the notion of the general p-affine capacity and prove some basic properties for the general p-affine capacity, such as affine invariance and monotonicity. The newly proposed general p-affine capacity is compared with several classical geometric quantities, e.g., the volume, the p-var…
While symplectic manifolds have no local invariants, they do admit many global numerical invariants. Prominent among them are the so-called symplectic capacities. Different capacities are defined in different ways, and so relations between capacities often lead to surprising relations between different aspects of sympl…
We discuss investment allocation to multiple alpha streams traded on the same execution platform with internal crossing of trades and point out differences with allocating investment when alpha streams are traded on separate execution platforms with no crossing. First, in the latter case allocation weights are non-nega…
Study excess capacity in neural networks using Rademacher complexity.
problem Understanding how much capacity deep networks have beyond what's needed for classification.
method Unified Rademacher complexity bounds for function composition and convolutional layers, considering Lipschitz constants and initialization norms.
result There is substantial excess capacity per task, and capacity can be kept similar across different tasks.
Study rigidity by logarithmic capacity and related functions.
problem Rigidity phenomena in kernel functions and capacities.
method Exploration of Bergman kernel, logarithmic capacity, Green's function, and Euclidean distance/volume.
result Established rigidity theorems by logarithmic capacity.
Study binary perceptrons' capacity using random duality theory.
problem Characterize the capacity of binary perceptrons with general thresholds.
method Utilized fully lifted random duality theory (fl RDT) to characterize the capacity.
result Characterizations match replica symmetry breaking predictions and uncover the capacity for zero-threshold scenario.
Study capacity constraints in continual learning with a simple model.
problem Understanding optimal resource allocation for agents with limited memory and compute resources.
method Analyzes a capacity-constrained linear-quadratic-Gaussian (LQG) sequential prediction problem and demonstrates optimal capacity allocation strategies.
result Derives a solution to the capacity-constrained LQG sequential prediction problem and shows how to optimally allocate capacity across sub-problems in the steady state.
New complete panel dataset for LMICs helps analyze innovation and development.
problem Lack of complete data for empirical analyses in LMICs.
method Predictive Mean Matching multiple imputation technique.
result Created a large dataset of 47 variables for 82 LMICs from 2005-2019.
Upper bounds for Lagrangian capacities of Liouville domains
problem Lagrangian capacity of Liouville domains
method Using S1-equivariant techniques result Extremal Lagrangian torus on the boundary of ellipsoid
Memory capacity of DAM scales exponentially with feature separation, unaffected by correlations.
problem Understanding how feature correlations impact DAM's capacity.
method Developed an empirical framework to analyze DAM's capacity under varying feature correlations and pattern separations.
result Memory capacity scales exponentially with feature separation, unaffected by correlations.
Proves local maximizers for higher Ekeland-Hofer capacities in 4D star-shaped domains.
problem Finding local maximizers for higher Ekeland-Hofer capacities in specific domains.
method Analogous to 4D local Viterbo conjecture, proving maximizers for rational ellipsoids.
result Local maximizers of the k-th Ekeland-Hofer capacities are symplectomorphic to rational ellipsoids.
The paper models insurance market dynamics under uncertainty and financial frictions.
problem Modeling insurer behavior under uncertainty and financial frictions.
method Dynamic equilibrium model of insurance market with competitive insurers maximizing shareholder value.
result Investment can lead to lower insurance prices and negative loadings under certain conditions.
Develops a theory for mth order p-affine capacity for convex bodies containing the origin.
problem Defines and studies the mth order p-affine capacity for convex bodies containing the origin.
method Provides equivalent definitions, proves properties, and establishes inequalities.
result Establishes inequalities comparing to other geometric measures.
Derives an empirical capacity model for self-attention neural networks.
problem Theoretical capacity of large transformer models is not fully utilized by current optimization algorithms.
method Analyzes memory capacity of transformers using synthetic training data and common training algorithms.
result Derives an empirical capacity model (ECM) for a generic transformer.
Improving the performance of click-through rate (CTR) prediction remains one of the core tasks in online advertising systems. With the rise of deep learning, CTR prediction models with deep networks remarkably enhance model capacities. In deep CTR models, exploiting users' historical data is essential for learning user…
Improves online learning algorithms for functional models with capacity assumptions.
problem Convergence rates of online stochastic gradient descent algorithms for functional linear models.
method Characterizations of slope function regularity, kernel space capacity, and sampling process covariance operator.
result Capacity assumptions can alleviate saturation of convergence rates as function regularity increases.
We introduce the concept of pseudo symplectic capacities which is a mild generalization of that of symplectic capacities. As a generalization of the Hofer-Zehnder capacity we construct a Hofer-Zehnder type pseudo symplectic capacity and estimate it in terms of Gromov-Witten invariants. The (pseudo) symplectic capacitie…
Study relates symplectic homology capacity to periodic orbits in Liouville domains.
problem Relating symplectic homology capacity to periodic orbits in Liouville domains.
method Uses positive symplectic homology and Hofer-Zehnder capacity to establish bounds and existence of periodic points.
result Non-zero positive symplectic homology implies finite upper bound for Hofer-Zehnder capacity relative to skeleton and Hamiltonian diffeomorphisms.
Learning capacity measures model complexity, correlating with test loss and sample size.
problem Understanding model complexity and its relation to test performance.
method Formal correspondence between thermodynamics and inference; learning capacity as a measure of effective dimensionality.
result Learning capacity correlates with test loss and is a small fraction of model parameters.
Study compares Monge-Ampère capacities on Kähler manifolds.
problem Comparing Monge-Ampère capacities on compact Kähler manifolds.
method Proved all capacities comparable, used Xia's integration by parts formula.
result All Monge-Ampère capacities are comparable.
Generalizes memory and forecasting capacities for nonlinear recurrent networks with dependent inputs.
problem Understanding memory and forecasting capabilities in networks with dependent inputs.
method Formulated bounds for memory and forecasting capacities in terms of network size and input properties.
result Proved that memory capacity for linear recurrent networks with independent inputs is given by the rank of the controllability matrix.
This paper is devoted to a geometric-measure-theoretic study of the brand new affine BV-capacity which is essentially different from the classic BV-capacity in dimension greater than one.