Paper connects surface shape analysis and unbalanced optimal transport.
problem Computing the SRNF shape distance on piecewise linear surfaces.
method Characterizes SRNF shape distance as WFR distance pullback, proposes new algorithm for WFR distance computation.
result Direct computation of SRNF shape distance on piecewise linear surfaces.
SRNF framework extends surface distance to Lipschitz surfaces.
problem Defining a distance metric for unparametrized surfaces.
method Square Root Normal Fields (SRNF) and Wasserstein Fisher Rao (WFR) metric.
result SRNF distance on Lipschitz surfaces is equivalent to WFR metric.
This paper puts forth a new formulation and algorithm for the elastic matching problem on unparametrized curves and surfaces. Our approach combines the frameworks of square root normal fields and varifold fidelity metrics into a novel framework, which has several potential advantages over previous works. First, our var…
Solves non-Abelian Rainich problem for SU(2) gauge fields.
problem Existence of local SU(2) Yang-Mills fields with prescribed stress-energy tensor.
method Canonically identifying tensors with Hermitian forms and defining internal square roots of stress-energy tensors.
result Existence of local SU(2) Yang-Mills field is equivalent to a single differential condition on internal square roots of stress-energy tensor.
A new numerical framework simplifies elastic surface matching and comparison.
problem Challenging problem in surface comparison and matching in computer vision.
method Relaxing the geodesic boundary constraint using a varifold fidelity metric.
result Flexibility to deal with arbitrary topologies and sampling patterns, scalability to large meshes.
We formulate the problem of neural network optimization as Bayesian filtering, where the observations are the backpropagated gradients. While neural network optimization has previously been studied using natural gradient methods which are closely related to Bayesian inference, they were unable to recover standard optim…
This paper presents a general framework for norm-based capacity control for Lp,q weight normalized deep neural networks. We establish the upper bound on the Rademacher complexities of this family. With an Lp,q normalization where q≤p∗, and 1/p+1/p∗=1, we discuss properties of a width-independent ca…
Layer normalization (LayerNorm) has been successfully applied to various deep neural networks to help stabilize training and boost model convergence because of its capability in handling re-centering and re-scaling of both inputs and weight matrix. However, the computational overhead introduced by LayerNorm makes these…
We apply an asymmetric version of Kirman's herding model to volatile financial markets. In the relation between returns and agent concentration we use the square root law proposed by Zhang. This can be derived by extending the idea of a critical mean field theory suggested by Plerou et al. We show that this model is eq…
Study differential properties of matrix square roots in specific cases.
problem Understanding matrix square roots in semi-simple, symmetric, and orthogonal cases.
method Analysis of differential and metric structures of real square roots of matrices under specific conditions.
result Differential properties of matrix square roots in semi-simple, symmetric, and orthogonal cases.
Agent-based market shows herding cycles with square-root price impact.
problem Understanding herding cycles in agent-based markets.
method Agent-based model with 20,000 retail traders interacting with a single institutional agent.
result Agent discovers multi-cycle predatory strategy with 8-11 complete cycles over 2000 trading days.
A new method simulates square-root processes efficiently.
problem Simulating square-root processes accurately and efficiently.
method Simulate the integrated square-root process instead of the square-root process itself.
result High precision with low number of time steps, and exact limiting Inverse Gaussian distributions.
Covariance pooling is a feature pooling method with good classification accuracy. Because covariance features consist of second-order statistics, the scale of the feature elements are varied. Therefore, normalizing covariance features using a matrix square root affects the performance improvement. When pooling methods …
Guarantees uniform convergence for square-root Lipschitz losses.
problem Uniform convergence guarantees for square-root Lipschitz losses.
method Using Rademacher complexity and square root of scalar loss function Lipschitz constant.
result Generalizes previous results and handles non-smooth loss functions.
We show that once-extended anomalous 3-dimensional topological quantum field theories valued in the 2-category of k-linear categories are in canonical bijection with modular tensor categories equipped with a square root of the global dimension in each factor.
Study finds price impact follows a 'double' square-root law, suggesting mechanical origin.
problem Understanding the origin of price impact in markets.
method Detailed dataset of Tokyo Stock Exchange orders, analyzing single and metaorders.
result Price impact follows a 'double' square-root law, indicating mechanical origin rather than information.
Through the direct study of the analysis estimator we derive oracle inequalities with fast and slow rates by adapting the arguments involving projections by Dalalyan, Hebiri and Lederer (2017). We then extend the theory to the square root analysis estimator. Finally, we focus on (square root) total variation regularize…
We introduce the concept of bi-conformal transformation, as a generalization of conformal ones, by allowing two orthogonal parts of a manifold with metric $\G$ to be scaled by different conformal factors. In particular, we study their infinitesimal version, called bi-conformal vector fields. We show the differential co…
Root Laplacian Eigenmaps help in spectral embedding of graphs.
problem Efficient spectral embedding of graphs.
method Square root of graph-Laplacian operator.
result Improved spectral embedding techniques.
A new method solves large-scale sparse group square-root Lasso problems efficiently.
problem Large-scale linearly constrained sparse group square-root Lasso problems.
method Dual semismooth Newton based augmented Lagrangian method (ALM).
result The proposed method efficiently solves the problem with numerical experiments demonstrating its effectiveness.
Unified geometric interpretation of statistical estimation inequalities.
problem Curvature corrections in parametric statistical estimation.
method Cartan-geometric jet bundle formulation and jet prolongations.
result Unified geometric interpretation of higher-order information inequalities.
Square-root natural-gradient improves variational inference convergence.
problem Challenges in establishing theoretical convergence guarantees for natural-gradient descent.
method Square-root parameterization for Gaussian covariance.
result Establishes novel convergence guarantees for natural-gradient Gaussian inference.
Many independent studies on stocks and futures contracts have established that market impact is proportional to the square-root of the executed volume. Is market impact quantitatively similar for option markets as well? In order to answer this question, we have analyzed the impact of a large proprietary data set of opt…
The notion of market impact is subtle and sometimes misinterpreted. Here we argue that impact should not be misconstrued as volatility. In particular, the so-called ``square-root impact law'', which states that impact grows as the square-root of traded volume, has nothing to do with price diffusion, i.e. that typical p…
Thanks to a recent result by Jean-Marc Schlenker, we establish an explicit linear inequality between the normalized entropies of pseudo-Anosov automorphisms and the hyperbolic volumes of their mapping tori. As its corollaries, we give an improved lower bound for values of entropies of pseudo-Anosovs on a surface with f…
OPAA estimates probability densities using functional analysis.
problem Estimating probability density functions efficiently and accurately.
method OPAA uses a parallelizable algorithm based on functional analysis to estimate probability distributions.
result OPAA provides an efficient method to estimate probability density functions and normalizing weights.
The Volterra square-root process shows non-uniqueness of limiting distributions and regularity of its law.
problem Non-uniqueness of limiting distributions in the Volterra square-root process.
method Establishing existence of limiting distributions using integrability of the Volterra convolution kernel and exponential-affine transformation.
result The limiting distributions of the Volterra square-root process depend on the initial state and belong to weighted Besov spaces.
Batch normalization dramatically increases the largest trainable depth of residual networks, and this benefit has been crucial to the empirical success of deep residual networks on a wide range of benchmarks. We show that this key benefit arises because, at initialization, batch normalization downscales the residual br…
The study confirms that market volatility can be explained by correlated metaorders impacting prices in a square-root fashion.
problem Explaining market volatility using metaorders and their impact.
method Generated synthetic market data and analyzed the correlation between order flow and returns.
result The square-root law of market impact is confirmed and can be measured from anonymized trade data.
Revisiting Trade-sign Long-memory and Square-root Law price impact
problem Revisiting the Lillo-Mike-Farmer (LMF) theory and the square-root law (SQRL) of meta-order impact
method Using a coupled discrete reaction-diffusion formulation
result Long-memory of trade signs and square-root law of meta-order impact
The paper studies a modified scalar curvature flow and proves convergence to a sphere.
problem Analyzing the convergence of a modified scalar curvature flow.
method Flow of starshaped hypersurfaces with a specific speed function, proving existence and convergence.
result The flow converges exponentially fast to a sphere, except for α<2. We confirm the square-root law of market impact on Apple Inc. using a large dataset.
problem Testing the square-root law of market impact on a single U.S. large-cap equity.
method Using a full market-by-order feed, we reconstruct metaorders and calibrate impact using the square-root formula.
result The square-root law is confirmed with a prefactor of 0.34, consistent with worldwide data.
New algorithms reduce contextual bandits' regret without knowing reward noise variances.
problem Reducing regret in contextual bandits with unknown reward noise variances.
method Developed new algorithms based on the optimism principle.
result Regret scales as the square root of the sum of measurement variances, not the time horizon.
The square root velocity framework is a method in shape analysis to define a distance between curves and functional data. Identifying two curves if they differ by a reparametrisation leads to the quotient space of unparametrised curves. In this paper we study analytical and topological aspects of this construction for …
In this paper we demonstrate predicting electroencephalograpgy (EEG) features from acoustic features using recurrent neural network (RNN) based regression model and generative adversarial network (GAN). We predict various types of EEG features from acoustic features. We compare our results with the previously studied p…
Efficiently computes matrix square roots and their inverses for large matrices.
problem Computing matrix square roots and inverses for large matrices efficiently.
method Combines Krylov subspace methods with rational approximation for quadratic-time computation.
result Achieves 4 decimal places of accuracy with fewer than 100 matrix-vector multiplications.
Novel approach integrates Multivariate Square-root Lasso into Synthetic Control for high-dimensional data.
problem Challenges in practical implementation and computational efficiency of Synthetic Control method for high-dimensional disaggregated data.
method Integrates Multivariate Square-root Lasso into Synthetic Control framework.
result Demonstrates superior computational efficiency without compromising estimation accuracy.
This thesis examines the accuracy of scaling VaR estimates for longer holding periods.
problem The accuracy of VaR estimates for longer holding periods using the square root of time rule.
method Examined VaR scaling for longer holding periods using empirical analysis.
result Scaling can provide good estimates of VaR but may lead to significant losses over time.
TPSQRs model longitudinal event data, detecting ADRs from EHRs.
problem Detecting adverse drug reactions from longitudinal event data.
method Learned by estimating a collection of interrelated PSQRs, using Poisson pseudo-likelihood for estimation.
result TPSQRs effectively and efficiently recover ADR signals from EHRs.
This paper explains how predictable order flow can lead to Brownian motion in financial prices.
problem Why financial prices exhibit Brownian motion despite predictable order flow.
method Generalized Lillo-Mike-Farmer model to nonlinear price-impact dynamics, mapping to Lévy-walk model.
result Price dynamics remain diffusive under the square-root law, even with persistent order flow.
Improved survival analysis using square root Cox's models and neural networks.
problem Feature selection in survival analysis.
method Square root Cox's survival analysis by the fittest linear and neural networks model, directly tuning penalty parameter λ.
result Substantially improved over traditional methods, achieving phase transition in feature selection.
The paper establishes a uniform Lipschitz bound on the square root of the systole function in Teichmüller space.
problem Uniform Lipschitz bounds on geometric functions in Teichmüller space.
method Injectivity radius analysis and Lipschitz bounds on systole function.
result Uniform Lipschitz constant for the square root of the systole function on Teichmüller space.
Enhanced ensemble filters use machine learning to improve accuracy in filtering models.
problem Accuracy limitations of traditional ensemble Kalman filters.
method Introduces a measure neural mapping (MNM) to map joint predicted state and observation to updated state estimates.
result Superior root-mean-square-error performance compared to leading methods in filtering models.
Study on the geometric Dyson Brownian motion of non-square matrix products.
problem Understanding the spectrum of a product of non-square random matrices.
method Proportional depth-width limit followed by mean-field limit, solving Burgers equation.
result Free log-normal law is obtained in the identity-start case.
In this paper, we prove that on any contact manifold, there exists an arbitrary C^{\infty}-small contactomorphism which does not admit a square root. In particular, there exists an arbitrary C^{\infty}-small contactomorphism which is not "autonomous". This result is the first step to study the topology of non-autonomou…
The chapter reviews metrics for comparing curves, focusing on quotient elastic and square root velocity metrics.
problem Comparing and analyzing shapes of curves.
method Construction and theoretical properties of quotient elastic metrics, special case of square root velocity metric, numerical approaches for estimation.
result Simplified expression for the square root velocity metric distance.
A new scheme reduces global search cost by a square root factor.
problem Challenges in finding global minimum of cost functions.
method Gradient descent combined with a biased crossover of two good solutions.
result Quadratic speedup of global search efficiency.
The Square Root Normal Field (SRNF), introduced by Jermyn et al. in [3], provides a way of representing immersed surfaces in R3, and equipping the set of these immersions with a "distance function" (to be precise, a pseudometric) that is easy to compute. Importantly, this distance function is invariant under…