Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

68136203271 · Jun 202019922001200920172026
48 results for boundary layers

A new runtime for AI agents calculates risks in real-time.

problem Managing risks and liabilities in autonomous AI actions.
method A time-consistent counterfactual actuarial layer with explicit underwriting boundaries.
result Establishes a well-defined toll and guarantees executed-action budgets.

Smectic liquid crystals are materials formed by stacking deformable, fluid layers. Though smectics prefer to have flat, uniformly-spaced layers, boundary conditions can impose curvature on the layers. Since the layer spacing and curvature are intertwined, the problem of finding minimal configurations for the layers bec…

2006-01-20abs ↗pdf ↗

A new method for imbalanced binary classification without resampling.

problem Imbalanced binary classification tasks where majority class under-representation leads to information loss.
method Layered learning approach with two stages: clustering and classification.
result The method outperforms state-of-the-art methods in 100 benchmark data sets.

We use layer potential to establish that the boundary biharmonic Steklov operators are elliptic pseudo-differential operators. Thus we are able to establish lower bounds on both the measure of boundary nodal sets and interior nodal sets for biharmonic Steklov eigenfunctions.

2015-06-05abs ↗pdf ↗

Large twist-angle grain boundaries in layered structures are often described by Scherk's first surface whereas small twist-angle grain boundaries are usually described in terms of an array of screw dislocations. We show that there is no essential distinction between these two descriptions and that, in particular, their…

1998-08-27abs ↗pdf ↗

LGAC enhances heat transfer in turbulent boundary layers using slot jets.

problem Enhancing convective heat transfer in turbulent boundary layers.
method Artificial intelligence-based linear genetic algorithms control (LGAC) with slot jets.
result LGAC optimizes heat transfer and flow asymmetry in turbulent boundary layers.

BEKAN uses RBFs and evolutionary methods to solve PDEs with boundary conditions.

problem Enforcing boundary conditions in neural networks for PDE solutions.
method Boundary condition-guaranteed evolutionary Kolmogorov-Arnold Network (BEKAN) with radial basis functions (RBFs). Incorporates Dirichlet, periodic, and Neumann conditions.
result BEKAN outperforms MLP and B-splines KAN in solving PDEs with boundary conditions.

We construct and analyze minimal disc stackings with bounds on their Morse index.

problem Constructing and analyzing minimal free boundary disc stackings.
method Constructing minimal free boundary disc stackings in a three-dimensional Euclidean unit ball, proving bounds on their Morse index.
result Uniform, linear bounds on the Morse index of all such surfaces.

Soft-Radial Projection solves gradient saturation in constrained deep learning.

problem Gradient saturation in deep learning models when integrating hard constraints.
method Introduces Soft-Radial Projection, a differentiable layer that maps predictions onto constraint boundaries without rank-deficient Jacobians.
result Improves convergence and solution quality over state-of-the-art methods.

Local invertibility of ray transforms on convex manifolds.

problem Invertibility of ray transforms on compact Riemannian manifolds with strictly convex boundary.
method Local invertibility results for transverse and mixed ray transforms of 1 and 1+1 tensors.
result Local invertibility of ray transforms near boundary points, leading to global results.

Paper proves convergence of MDL to Einstein-Hilbert with boundary term.

problem Proving convergence of discrete MDL to continuous Einstein-Hilbert action.
method Proves \(Γ\)-convergence using diffeomorphism-natural discrete MDL-type functional.
result Identifies Carathéodory densities and obtains \(\liminf/\limsup\) bounds.

New method initializes sigmoidal MLPs for interpretable shapes.

problem Creating interpretable decision boundaries in neural networks.
method Introducing a geometry-aware initialization for sigmoidal multi-layer perceptrons (MLPs) using tropical geometry.
result Sigmoidal MLPs can have decision boundaries aligned with prescribed shapes at initialization.

A new tensor network method for image classification reduces computation cost.

problem Efficiently classifying images in high-dimensional spaces.
method Proposes a multi-layered tensor network (MLTN) that performs one MPS operation per layer, reducing computation cost.
result Reduces computation cost without degrading performance.

Neural networks compress uninformative input directions, improving test error.

problem Data lie in a high-dimensional space but labels vary along a lower-dimensional manifold.
method One-hidden layer network trained with gradient descent, analyzing weight evolution and compression.
result Compression factor λ ∼ √p improves test error, with β Feature > β Lazy.

We present a formulation of deep learning that aims at producing a large margin classifier. The notion of margin, minimum distance to a decision boundary, has served as the foundation of several theoretically profound and empirically successful results for both classification and regression tasks. However, most large m…

2018-03-15abs ↗pdf ↗

The paper explores transferability of adversarial examples between convex and 01 loss models, finding non-transferability due to different decision boundaries caused by outliers.

problem Transferability of adversarial examples between convex and 01 loss models.
method Empirical study of transferability between linear 01 loss and convex (hinge) loss models, and between neural networks with different activation functions.
result Adversarial examples are non-transferable between convex and 01 loss models due to different decision boundaries caused by outliers.

We provide a theoretical explanation of the role of the number of nodes at each layer in deep neural networks. We prove that the largest variation of a deep neural network with ReLU activation function arises when the layer with the fewest nodes changes its activation pattern. An important implication is that deep neur…

2018-12-02abs ↗pdf ↗

We prove that a potential qq can be reconstructed from the Dirichlet-to-Neumann map for the Schrodinger operator Δg+q-Δ_g + q in a fixed admissible 3-dimensional Riemannian manifold (M,g)(M,g). We also show that an admissible metric gg in a fixed conformal class can be constructed from the Dirichlet-to-Neumann map for $Δ_…

2010-11-02abs ↗pdf ↗

Novel boundary integral equations for Dirac operators in 3D Lipschitz domains.

problem Developing equations for Dirac operators in complex 3D domains.
method First-kind boundary integral equations, generalized Garding inequalities, Fredholm operators, finite dimensional kernels, Betti numbers.
result Finite dimensional kernels equal to the sum of Betti numbers, explaining the bilinear forms.

A family of one-vertex triangulations of 3-manifolds, layered-triangulations, is defined. Layered-triangulations are first described for handlebodies and then extended to all 3-manifolds via Heegaard splittings. A complete and detailed analysis of layered-triangulations is given in the cases of the solid torus and lens…

2006-03-25abs ↗pdf ↗

Combining Bayesian nonparametrics and a forward model selection strategy, we construct parsimonious Bayesian deep networks (PBDNs) that infer capacity-regularized network architectures from the data and require neither cross-validation nor fine-tuning when training the model. One of the two essential components of a PB…

2018-05-22abs ↗pdf ↗

In order to classify linearly non-separable data, neurons are typically organized into multi-layer neural networks that are equipped with at least one hidden layer. Inspired by some recent discoveries in neuroscience, we propose a new model of artificial neuron along with a novel activation function enabling the learni…

2020-02-02abs ↗pdf ↗

Study well-posedness of generalized Stokes operator on cylindrical domains.

problem Analyzing the generalized Stokes operator on domains with cylindrical ends.
method Using layer potentials and developing algebra tools for limit and jump relations.
result Well-posedness results for the associated Stokes boundary value problem.

ManifoldFlow relaxes fixed-spectrum Stiefel layers to learn a positive spectrum.

problem Fixed-spectrum Stiefel layers impose rigid spectral constraints.
method Introduces ManifoldFlow, a relaxation that learns a positive spectrum while keeping the basis on the Stiefel manifold.
result Learnable SPD spectrum improves performance in various settings.

New neural network approach solves Poisson equations efficiently.

problem Approximating solutions to Poisson equations with Dirichlet boundary conditions.
method Using shallow ReLUα-networks to solve Laplace operator equations.
result Neural networks can approximate solutions to the Laplace operator with Dirichlet boundary conditions efficiently.

A classification of spanning surfaces for alternating links is provided up to genus, orientability, and a new invariant that we call aggregate slope. That is, given an alternating link, we determine all possible combinations of genus, orientability, and aggregate slope that a surface spanning that link can have. To thi…

2012-05-24abs ↗pdf ↗

In this paper, we propose a capsule-based neural network model to solve the semantic segmentation problem. By taking advantage of the extractable part-whole dependencies available in capsule layers, we derive the probabilities of the class labels for individual capsules through a recursive, layer-by-layer procedure. We…

2019-01-09abs ↗pdf ↗

Dropout training, originally designed for deep neural networks, has been successful on high-dimensional single-layer natural language tasks. This paper proposes a theoretical explanation for this phenomenon: we show that, under a generative Poisson topic model with long documents, dropout training improves the exponent…

2014-07-11abs ↗pdf ↗

It is shown that given any link-manifold, there is an algorithm to decide if the manifold contains an embedded, essential planar surface; if it does, the algorithm will construct one. If a slope on the boundary of the link-manifold is given, there is an algorithm to determine if the slope bounds an embedded punctured-d…

2006-08-28abs ↗pdf ↗

A major challenge in Bayesian Optimization is the boundary issue (Swersky, 2017) where an algorithm spends too many evaluations near the boundary of its search space. In this paper, we propose BOCK, Bayesian Optimization with Cylindrical Kernels, whose basic idea is to transform the ball geometry of the search space us…

2018-06-05abs ↗pdf ↗

Semantic boundary and edge detection aims at simultaneously detecting object edge pixels in images and assigning class labels to them. Systematic training of predictors for this task requires the labeling of edges in images which is a particularly tedious task. We propose a novel strategy for solving this task, when pi…

2016-06-29abs ↗pdf ↗

Agol recently introduced the notion of a veering triangulation, and showed that such triangulations naturally arise as layered triangulations of fibered hyperbolic 3-manifolds. We prove, by a constructive argument, that every veering triangulation admits positive angle structures, recovering a result of Hodgson, Rubins…

2010-12-23abs ↗pdf ↗

We study the geometry of deep (neural) networks (DNs) with piecewise affine and convex nonlinearities. The layers of such DNs have been shown to be {\em max-affine spline operators} (MASOs) that partition their input space and apply a region-dependent affine mapping to their input to produce their output. We demonstrat…

2019-05-21abs ↗pdf ↗

Deep NURBS improves PINNs for solving PDEs on arbitrary geometries.

problem Solving partial differential equations on complex geometries with physics constraints.
method Combines admissible NURBS parametrizations and PINN solver for arbitrary geometries.
result High convergence rate and accuracy for most PDEs using Deep NURBS.