Develops a mathematical model for automatic differentiation in machine learning.
problem Current automatic differentiation lacks a simple mathematical model for machine learning.
method Articulates relationships between program differentiation and nonsmooth functions, provides a class of functions and nonsmooth calculus.
result Shows how nonsmooth calculus applies to stochastic approximation methods and evidence of artificial critical points.
Critical learning periods found in deep linear networks too.
problem Understanding why critical learning periods emerge in both biological and artificial networks.
method Focused on deep linear network models, analyzed depth and data distribution, and examined multi-task learning.
result Critical periods depend on model depth and data distribution structure, and pre-training can affect transfer performance.
This study investigates self-organizing dynamics in a stochastic exponential DAM model using Temporal Complexity.
problem Understanding self-organizing behavior in artificial neural systems.
method Investigation of a stochastic exponential DAM model through Temporal Complexity analysis.
result The model exhibits regimes of complex intermittency with nontrivial temporal correlations and scale-free behavior.
Study evaluates saliency maps on artificial data with different backgrounds.
problem Objective evaluation of saliency methods on artificial data with varying backgrounds.
method Developed a framework to generate artificial data with synthetic lesions and a known ground truth map, evaluated two data sets with different backgrounds (Perlin noise and 2D brain MRI slices).
result Heatmaps vary strongly between saliency methods and backgrounds.
AI system predicts acute critical illness from EHRs with explainability.
problem Lack of clinical interpretability in AI predictions for acute critical illness.
method Developed an explainable AI early warning score (xAI-EWS) system.
result System provides clinicians with insights into EHR data explaining predictions.
We address the question of market efficiency using the Minority Game (MG) model. First we show that removing unrealistic features of the MG leads to models which reproduce a scaling behavior close to what is observed in real markets. In particular we find that i) fat tails and clustered volatility arise at the phase tr…
TUV Austria proposes certification for ML applications to ensure reliability.
problem Ensuring trust in AI applications to meet societal reliance requirements.
method Holistic approach analyzing security, functionality, data quality, ethics, and criticality levels.
result Certification process for low-risk ML applications in supervised learning.
This paper uses decolonial theory to improve AI's ethical development.
problem AI's risks to vulnerable peoples and negative impacts of innovation.
method Embedding decolonial critical approach in AI technical practice.
result Developing tactics to align AI with ethical principles.
We present a simple order book mechanism that regulates an artificial financial market with self-organized criticality dynamics and fat tails of returns distribution. The model shows the role played by individual imitation in determining trading decisions, while fruitfully replicates typical aggregate market behavior a…
Neural networks compress and sample WDN contamination dynamics efficiently.
problem Infrastructure monitoring of complex, networked systems like water distribution networks is expensive and challenging.
method Developed Graph Fourier Transform (GFT) operators and neural networks (NN) for efficient data collection and inference.
result High accuracy reconstruction of contamination dynamics using only 5-10% of the sample set.
Deep neural networks near edge of chaos show universal scaling laws.
problem Understanding the behavior of deep neural networks near critical points.
method Analogy to absorbing phase transitions in statistical mechanics, deterministic propagation dynamics, mean-field and directed percolation universality classes.
result Deep neural networks exhibit universal scaling laws near the edge of chaos.
Sequential processing biases asset allocation in artificial stock markets.
problem Systematic bias in asset allocation due to sequential processing of order books.
method Examined the impact of sequential versus parallel clearing mechanisms on multi-asset price dynamics.
result Sequential processing introduces a significant bias affecting the allocation of traders' capital.
This paper reverses a construction by merging boundary critical points into an interior one.
problem Pushing interior critical points to the boundary and splitting them into two boundary points.
method Specific assumptions allow merging two boundary critical points into one interior critical point.
result Merging two boundary critical points into a single interior critical point.
The minimal number of critical points is studied for smooth functions on closed manifolds.
problem Determining the minimal number of critical points for smooth functions on closed manifolds.
method Investigates cylindrical ball neighborhoods and exotic critical points, proving the conjecture for certain types of critical points.
result The minimal number of critical points is the same for smooth functions without exotic critical points on closed manifolds of dimension at least 6.
A new score function improves explainability and reliability of AI systems.
problem Designing AI systems that are explainable, robust, and trustworthy.
method Integrates conformal prediction with explainable machine learning using a novel score function.
result The method achieves improved performance on target classes and satisfies conformal guarantees.
The paper simplifies conditions for optimal paths on manifolds avoiding obstacles.
problem Finding optimal paths on manifolds avoiding obstacles.
method Study of sufficient conditions for optimality on Riemannian manifolds and Lie groups.
result New conditions for optimality are provided in terms of matrix invertibility.
The study confirms a conjecture about critical points of smooth functions.
problem Understanding isolated critical points of smooth functions.
method Investigated cone-like, reasonable, and Rothe H hypothesis critical points.
result The conjecture holds true for certain critical points.
Hard to approximate critical points for simple nonconvex functions.
problem Approximating critical points of nonconvex functions.
method Proving hardness results for polynomial-time approximation of critical points.
result Proving that approximating critical points is intractable for simple nonconvex functions.
New methods for explaining Random Forest predictions using case-based reasoning.
problem Lack of explainability for black-box machine learning models like Random Forests.
method Extracting distance metric from Random Forests to identify prototypes, critics, counter-factuals, and semi-factuals.
result Identified special points from training datasets to explain Random Forest predictions.
The paper reports the construction of artificial stock market that emerges the similar statistical facts with real data in Indonesian stock market. We use the individual but dominant data, i.e.: PT TELKOM in hourly interval. The artificial stock market shows standard statistical facts, e.g.: volatility clustering, the …
Symmetric critical points lead to symmetry breaking in neural networks.
problem Understanding symmetry in critical points of invariant functions.
method Analyzing the symmetry of critical points and their neighbors in invariant nonconvex functions.
result Symmetric critical points in invariant nonconvex functions are generically followed by symmetry breaking adjacent points.
Upper bounds found for systole function critical points on surface moduli space.
problem Finding upper bounds for systole function critical points.
method Analyzing the systole function on the surface moduli space.
result Upper bounds for critical points of systole function and their systole values.
Study critical points of Laplace eigenfunctions in polygons.
problem Characterize critical points of Laplace eigenfunctions in polygonal domains.
method Analyze components of the critical set with codimension 1.
result For simply connected polygons, if a second Neumann eigenfunction has infinitely many critical points, the polygon must be a rectangle.
The paper studies critical points in overparameterized neural networks, identifying a star locus and degenerate critical points.
problem Understanding the geometry of loss functions in overparameterized neural networks.
method Identifying and analyzing components of the critical locus of the loss function L for overparameterized feedforward neural networks of depth ℓ≥4. result For very wide networks, all critical points are degenerate, and lower bounds on the number of zero eigenvalues of the Hessian are given.
The success of modern Artificial Intelligence (AI) technologies depends critically on the ability to learn non-linear functional dependencies from large, high dimensional data sets. Despite recent high-profile successes, empirical evidence indicates that the high predictive performance is often paired with low robustne…
Noninjective monodromy found in polynomial critical point tracking.
problem Tracking critical points in polynomials leads to noninjective monodromy.
method Monic squarefree complex polynomials with prescribed critical point multiplicities.
result Monodromy map is noninjective for polynomials with exactly two critical points.
In this paper are studied the simplest patterns of axial curvature lines (along which the normal curvature vector is at a vertex of the ellipse of curvature) near a critical point of a surface mapped into R4. These critical points, where the rank of the mapping drops from 2 to 1, occur isolated in generic one parameter…
Similar to humans and animals, deep artificial neural networks exhibit critical periods during which a temporary stimulus deficit can impair the development of a skill. The extent of the impairment depends on the onset and length of the deficit window, as in animal models, and on the size of the neural network. Deficit…
This paper focuses on the problem of topological equivalence of functions with isolated critical points on the boundary of a compact surface M which are also isolated critical points of their restrictions to the boundary. This class of functions we denote by Ω(M). Firstly, we've obtained the topological classificat…
The paper studies the smoothness of critical points of variational integrals on Hessian spaces.
problem The study focuses on the regularity of critical points of variational integrals defined on Hessian spaces.
method The approach involves solving a fourth order nonlinear equation and analyzing the Hessian of the critical points.
result Smooth critical points with bounded Hessian are shown to be smooth provided their Hessian has small BMO.
Study on critical points in random neural networks, revealing three regimes based on activation function.
problem Investigating the expected number of critical points in random neural networks.
method Deriving asymptotic formulas for critical points under infinite-width limit and suitable regularity conditions.
result Three distinct regimes of critical points behavior depending on activation function.
Numerically locating the critical points of non-convex surfaces is a long-standing problem central to many fields. Recently, the loss surfaces of deep neural networks have been explored to gain insight into outstanding questions in optimization, generalization, and network architecture design. However, the degree to wh…
Critical hypersurfaces with boundary have unique shapes and properties.
problem Characterizing the shapes of hypersurfaces with boundary and zero fractional mean curvature.
method Analyzing critical points of fractional area in RN with boundary conditions. result Critical hypersurfaces with specific boundary conditions are not simple shapes like (N−1)-balls. Recently, deep learning has been advancing the state of the art in artificial intelligence to a new level, and humans rely on artificial intelligence techniques more than ever. However, even with such unprecedented advancements, the lack of explanation regarding the decisions made by deep learning models and absence of…
The paper classifies and analyzes the stability of elastic curves with fixed endpoints.
problem Classification and stability of pinned elasticae.
method Critical points of the length-penalized elastic bending energy among planar curves with fixed endpoints.
result Explicit parametrization and classification of all critical points with a threshold parameter \(\hatλ \simeq 0.70107\).
Study classifies ruled surfaces critical to Dirichlet energy.
problem Identifying ruled surfaces critical to Dirichlet energy.
method Explicit parametrization of ruled surfaces.
result Classification of ruled surfaces as critical points of Dirichlet energy.
We study critical points of holomorphic sections of $\ocal(m)$ on $\CP^n$. For quadrics, we give a complete discription of their critical points. When n=1, we prove a spherical Gauss-Lucas theorem. For general situation, we prove that a general section has all its critical points isolated and non-degenerate.
The exponential map fails to be injective near critical points in sub-Riemannian geometry.
problem Injectivity failure of the exponential map at critical points in sub-Riemannian geometry.
method Analysis of the Hilbert invariant integral of the variational problem associated with the sub-Riemannian structure.
result Characterization of conjugate points in terms of metric structure.
Study shows flash crashes in finance are self-organized criticality events.
problem Understanding and predicting anomalous price events in high-frequency finance.
method Investigated volume distributions during flash crashes and linked them to self-organized criticality.
result Volume distributions during flash crashes indicate a diverging second moment, suggesting self-organized criticality.
Study on critical faces convergence in a Poisson point process.
problem Convergence of point processes associated with critical faces in a Čech filtration.
method Established convergence in M0-topology for critical faces above vanishing threshold. result Obtained limit theorems for positive and negative critical faces.
Ricci solitons as critical points of quadratic curvature functionals
problem Einstein metrics and Ricci solitons as critical points of quadratic Riemannian functionals
method Study of Ricci solitons as critical points of a special quadratic curvature functional
result Ricci solitons are non-Einstein critical points of these functionals
Study classifies Morse functions with 4 critical points on immersed 2-spheres.
problem Classifying Morse functions with 4 critical points on immersed 2-spheres.
method Used dual graph of immersion and Reeb graphs to classify functions.
result Found all possible structures of the functions.
Paper proves convex domains have one maximum for semi-stable solutions.
problem Analyzing critical points of semi-stable solutions on convex domains.
method Relating critical points to an auxiliary function and using topological degree.
result Positive, semi-stable solutions have exactly one non-degenerate critical point.
The paper proves conditions under which critical point metrics are Einstein.
problem Proving that critical point metrics are Einstein under specific curvature constraints.
method Analyzing the traceless Ricci operator and scalar curvature constraints.
result The conjecture that critical point metrics are Einstein is proven under certain curvature conditions.
Research characterizes critical points of scalar curvature functionals.
problem Characterizing critical points of scalar curvature functionals.
method Translation and analysis of a previous Russian paper.
result Provides insights into critical points of scalar curvature functionals.
To each isolated critical point of a smooth function on a 3-manifold we put in correspondence a tree (graph without cycles). We will prove that functions are topologically equivalent in the neighborhoods of critical points if and only if the corresponding trees are isomorphic. A complete topological invariant of functi…
Survey of algorithms for testing AI-driven CPS safety.
problem Testing AI-driven CPS for safety in complex environments.
method Survey of applied algorithms for safety validation.
result Survey of existing tools and techniques for safety validation.
Investigates energy minimizers and critical points of scale-invariant tangent-point energies for knots.
problem Finding and characterizing minimizers and critical points of scale-invariant tangent-point energies for closed curves.
method Develops convergence and regularity theories based on fractional Sobolev spaces and new energy functionals.
result Minimizing sequences converge to locally critical embeddings in all but finitely many points, and locally critical embeddings are regular.