The paper diagnoses factor models using characteristic axes and zero-curve restrictions.
problem Tackles systematic sign reversals and overcorrections in factor model pricing errors.
method Extends cap-axis integral diagnostic to general characteristic axes, measuring pricing errors as bridge-alpha curves.
result Axis-level pricing errors are nearly orthogonal to maximum-Sharpe gains, showing systematic sign reversals and overcorrections.
The paper diagnoses factor-model pricing errors using characteristic axes and bridge-alpha curves.
problem Tackles systematic sign reversals and overcorrections in factor-model pricing errors.
method Extends cap-axis integral diagnostic to characteristic axes, measures pricing errors as bridge-alpha curves, and uses a predetermined characteristic order to generate zero-curve restrictions.
result Axis-level pricing errors are nearly orthogonal to maximum-Sharpe gains, showing significant sign reversals and overcorrections.
Bayesian optimization finds best hyperparameters for deep learning models.
problem Finding optimal hyperparameters in high-dimensional space.
method Bayesian optimization, Gaussian processes, and adaptive experimentation.
result Ax, BoTorch, and GPyTorch provide a powerful and simple framework for hyperparameter optimization.
Method evaluates disentanglement in DLVMs, including those not aligned with latent axes.
problem Evaluate disentanglement in DLVMs, especially those not aligned with latent axes.
method Proposes a statistical method to discover generative factors of a dataset.
result Empirically demonstrates the advantage of the method on two datasets.
This paper diagnoses factor-model pricing errors using a new method.
problem Measuring pricing errors in factor models with general characteristic axes.
method Developed a method to measure factor-model pricing errors as bridge-alpha curves, using a predetermined characteristic order and prefix portfolios.
result Adding a counterpart factor flips the curve's sign on every axis, but only HML and CMA overcorrect enough to be rejected.
Paper proposes AXE loss for non-autoregressive machine translation, improving performance.
problem Challenges in training non-autoregressive models due to lack of autoregressive factors and cross entropy loss penalties.
method Proposes aligned cross entropy (AXE) loss function using a differentiable dynamic program for better word order alignment.
result AXE-based training improves performance on major WMT benchmarks and sets a new state of the art for non-autoregressive models.
New method flattens decision boundary by targeting shortcut-aligned axes in disentangled latent space.
problem Shortcut learning in neural networks, leading to poor out-of-distribution generalization.
method Injects targeted anisotropic noise to regularize classifier sensitivity along shortcut-aligned axes.
result Achieves state-of-the-art OOD performance without shortcut labels or conflicting samples.
The paper classifies hypersurfaces in Riemannian manifolds with constant inner product and torse-forming axes.
problem Understanding hypersurfaces in Riemannian manifolds with specific geometric properties.
method Analyzing hypersurfaces with constant inner product and torse-forming axes.
result Classification of hypersurfaces with torse-forming axes.
We study the Lipschitz metric on Outer Space and prove that fully irreducible elements of Out(F_n) act by hyperbolic isometries with axes which are strongly contracting. As a corollary, we prove that the axes of fully irreducible automorphisms in the Cayley graph of Out(F_n) are stable, meaning that a quasi-geodesic wi…
Self-focal points on ellipsoids of dimension 3 or higher are rare.
problem Existence of self-focal points on Riemannian manifolds of dimension 3 or higher.
method Analyzing geodesics and umbilic points on ellipsoids of various dimensions.
result Ellipsoids of dimension 3 or higher with at least 4 distinct axes have no self-focal points.
AXE evaluates explanations to avoid misleading Rashomon set model selection.
problem Evaluating explanations for Rashomon set models to avoid false selection.
method Proposed AXE method to evaluate explanation quality.
result AXE detects adversarial fairwashing with 100% success rate.
The class of the two-axes pseudo-Finslerian metrics which is specified by the condition of the angle-separation in the involved characteristic functions is proposed and studied. The complete Total Set of algebraic and differential equations is derived in all rigor which are necessary and sufficient in order that a pseu…
Study inverse curve shortening flow on hyperbolic plane, classifying solitons.
problem Understanding the behavior of curves in hyperbolic geometry under a specific flow.
method Classifying solitons with respect to vector fields and studying their properties.
result Parabolic solitons are graphs on the y-axis, conformal solitons on the x-axis.
The Conclusive Theorem has been established to determine the dependence of the three-axes positive-definite Finsleroid metric functions F on the Finsleroid azimuthal angle θ in the three-dimensional case N=3, provided that the condition of the angle-separation in the involved characteristic functions is implied. …
Proposes σ-PCA to learn identifiable linear transformations without whitening.
problem Cannot identify axes with equal variances in PCA.
method Unified model for linear and nonlinear PCA, introducing a missing piece to eliminate rotational indeterminacy.
result Eliminates subspace rotational indeterminacy in PCA.
In Garside groups, axes of Morse elements are strongly contracting.
problem Understanding the dynamics of Morse elements in Garside groups.
method Analyzing the Cayley graph of Garside groups modulo their center, using Garside generators.
result Morse elements act loxodromically on the additional length graph of Garside groups.
Recent results using inverse scattering techniques interpret every solution φ(x,y) of the sine-Gordon equation as a non-linear superposition of solutions along the axes x=0 and y=0. Here we provide a geometric method of integration, as well as a geometric interpretation. Specifically, every weakly regular surface…
This paper consists of two parts. In the first one we study the behaviour of medial axes (skeletons) of closed sets in a connected complete Riemannian manifold M under deformations. The second one is devoted to a similar study of conflict sets. We apply a new approach to the deformation process. Instead of …
Simpler proof for non-basic sets in 2D.
problem Proving non-basic sets in 2D.
method Defining Sternfeld arrays and proving non-basic sets.
result Simpler proof of non-basic sets in 2D.
On a Riemannian 2-torus (T2,g) we study the geodesic flow in the case of low complexity described by zero topological entropy. We show that this assumption implies a nearly integrable behavior. In our previous paper \cite{GK} we already obtained that the asymptotic direction and therefore also the rotation number ex…
We consider the problem of estimating an unknown signal x0 from noisy linear observations y=Ax0+z∈Rm. In many practical instances, x0 has a certain structure that can be captured by a structure inducing convex function f(⋅). For example, ℓ1 norm can be used to encourage a sparse solution. T…
We construct helicoid-like embedded minimal disks with axes along self-similar curves modeled on logarithmic spirals. The surfaces have a self-similarity inherited from the curves and the nature of the construction. Moreover, inside of a "logarithmic cone", the surfaces are embedded.
We show that some riemannian manifolds diffeomorphic to the sphere have the property that the cut loci of general points are smoothly embedded closed disks of codimension one. Ellipsoids with distinct axes are typical examples of such manifolds.
We consider non-elementary Kleinian groups Γ, without invariant plane, generated by an elliptic and a hyperbolic element with their axes lying in one plane. We find presentations and a complete list of orbifolds uniformized by such Γ.
New approach classifies rotational Weingarten surfaces in Lorentz-Minkowski space.
problem Classifying rotational Weingarten surfaces in Lorentz-Minkowski space.
method Using geometric linear momentum of generatrix curves with respect to axes of revolution.
result Unified framework for three causal types of rotation axes.
Unified scheme combining softmax and ResNet for deep learning.
problem Combining softmax and ResNet for deep learning.
method Theoretical analysis of a unified scheme combining softmax regression and ResNet.
result Unified scheme connects previously unrelated fields and provides insights into loss landscape and optimization.
PRUDEX-Compass evaluates FinRL methods on 6 axes for financial market investments.
problem Insufficient evaluation of FinRL methods in financial markets.
method Introduces PRUDEX-Compass with 6 axes and 17 measures for evaluation.
result Demonstrates the effectiveness of PRUDEX-Compass on 4 real-world datasets.
Developable ruled surfaces generated by curvature axes of curves.
problem Creating simple and understandable ruled surfaces for practical design.
method Investigating a straightforward method to generate developable ruled surfaces using curvature axes of curves.
result Developable ruled surfaces are generated by the curvature axes of curves, and these surfaces are developable.
Bayesian quadrature uses probabilistic models for estimating intractable integrals.
problem Estimating intractable integrals in complex models.
method Probabilistic, model-based approach using Gaussian processes.
result Comprehensive review and systematic taxonomy of Bayesian quadrature methods.
We study hypersurfaces either in the sphere \s{n+1} or in the hyperbolic space \h{n+1} whose position vector x satisfies the condition Lkx=Ax+b, where Lk is the linearized operator of the (k+1)-th mean curvature of the hypersurface for a fixed k=0,...,n−1, A∈R(n+2)×(n+2) is a constant matrix an…
We study optimal double helices with straight axes (or the fattest tubes around them) computationally using three kinds of functionals; ideal ones using ropelength, best volume packing ones, and energy minimizers using two one-parameter families of interaction energies between two strands of types r−α and $\frac1r…
Stochastic gradient descent regularizes least squares problems by smoothing large singular values.
problem Regularization of least squares problems using stochastic gradient descent.
method Analysis of stochastic gradient descent applied to least squares problems, showing a regularization effect.
result Stochastic gradient descent leads to a quick regularization effect, smoothing large singular values.
New PCA method for derivatives problems.
problem Reducing dimensionality in derivatives pricing models.
method Supervised Principal Component Analysis (PCA)
result Improved accuracy in machine learning applications.
Finite singular times for symmetric network curvature flow.
problem Formation of singularities in network curvature flow.
method Curvature flow of networks with symmetric initial data and two triple junctions.
result The set of singular times is finite.
MCPCA analyzes shared factors across multiple data contexts.
problem No tools to recover shared factors across multiple contexts.
method Developed a theoretical and algorithmic framework (MCPCA).
result Reveals shared axes of variation across subsets of contexts.
New findings challenge the traditional U-shaped curve of model complexity and error, revealing a second descent in error as model size increases.
problem The traditional U-shaped curve of model complexity and prediction error is incomplete, with recent work suggesting a second descent in error as model size increases.
method Careful consideration of multiple complexity axes and a nonparametric statistics perspective were used to interpret the observed double descent curves.
result The observed double descent curves in classical statistical machine learning methods fold back into traditional convex shapes, resolving tensions with statistical intuition.
A new knot invariant measures crossings in three orthogonal directions.
problem Defining a new knot invariant for certain knot diagrams.
method Defining the simultaneous crossing number for knots with doubly transvergent diagrams.
result The limit of the ratio of the new invariant to the usual crossing number is at most 8.
We show that there is no triangulation of the infinite real Grassmannian of k-planes in R^\infty which is nicely situated with respect to the coordinate axes. In terms of matroid theory, this says there is no triangulation of the Grassmannian subdividing the matroid stratification. This is proved by an argument in proj…
Helical ribbons arise in many biological and engineered systems, often driven by anisotropic surface stress, residual strain, and geometric or elastic mismatch between layers of a laminated composite. A full mathematical analysis is developed to analytically predict the equilibrium deformed helical shape of an initiall…
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.
Over-parameterized deep neural networks have proven to be able to learn an arbitrary dataset with 100% training accuracy. Because of a risk of overfitting and computational cost issues, we cannot afford to increase the number of network nodes if we want achieve better training results for medical images. Previous de…
This paper concerns the performance of the LASSO (also knows as basis pursuit denoising) for recovering sparse signals from undersampled, randomized, noisy measurements. We consider the recovery of the signal xo∈RN from n random and noisy linear observations y=Axo+w, where A is the measuremen…
The set of axes of hyperbolic elements in a Fuchsian group depends on the commensurability class of the group. In fact, it has been conjectured that it determines the commensurability class and this has been verified in for groups of the second kind by G. Mess and for arithemetic groups by by D. Long and A. Reid. Here …
The study confirms two cases of the convex body isoperimetric conjecture in the plane.
problem The least perimeter to enclose a given area inside a unit disk is greater than inside any other convex set.
method Examined symmetric domains and perturbations of the unit disk.
result Two cases of the convex body isoperimetric conjecture are confirmed.
This paper evaluates how well neural models can solve complex tasks by breaking them into simpler ones.
problem Measuring neural models' ability to solve complex tasks by breaking them into simpler subtasks.
method Characterized axes of compositional generalization, introduced a benchmark suite of tasks, and improved Transformer models' attention mechanisms.
result Modified Transformer models generally perform better than natural baselines in solving complex tasks, but challenges remain.
Clarifies challenges in machine learning uncertainty quantification.
problem Inconsistent terminology and diverse technical requirements for trustworthy uncertainties.
method Examines estimation targets, uncertainty constructs, and problematic mappings.
result Advocates for alignment between intent and implementation in UQ.
We consider constant mean curvature surfaces of finite topology, properly embedded in three-space in the sense of Alexandrov. Such surfaces with three ends and genus zero were constructed and completely classified by the authors in arXiv:math.DG/0102183. Here we extend the arguments to the case of an arbitrary number o…
Study tests feasibility of linear programs with bandit feedback.
problem Testing feasibility of unknown linear programs with bandit feedback.
method Developed a novel test based on low-regret algorithms and a nonasymptotic law of iterated logarithms.
result Proved that the test is reliable and adapts to the signal level, with mean sample costs scaling as \( \widetilde{O}(d^2/Γ^2) \).