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.
The paper examines how neural network topology affects adversarial robustness.
We prove flatness of complete Riemannian planes and cylinders without conjugate points under optimal conditions on the area growth.
We prove that every entire solution of the minimal graph equation that is bounded from below and has at most linear growth must be constant on a complete Riemannian manifold with only one end if has asymptotically non-negative sectional curvature. On the other hand, we prove the existence of bounded non-constan…
Optimal order execution strategies for brokers under reference benchmarks.
The time to converge to the steady state of a finite Markov chain can be greatly reduced by a lifting operation, which creates a new Markov chain on an expanded state space. For a class of quadratic objectives, we show an analogous behavior where a distributed ADMM algorithm can be seen as a lifting of Gradient Descent…
Since the debut of Evolution Strategies (ES) as a tool for Reinforcement Learning by Salimans et al. 2017, there has been interest in determining the exact relationship between the Evolution Strategies gradient and the gradient of a similar class of algorithms, Finite Differences (FD).(Zhang et al. 2017, Lehman et al. …
Survey on random walks on mapping class groups and their properties.
A usual reinsurance policy for insurance companies admits one or two layers of the payment deductions. Under optimal criterion of minimizing the conditional tail expectation (CTE) risk measure of the insurer's total risk, this article generalized an optimal stop-loss reinsurance policy to an optimal multi-layer reinsur…
Variable annuities, as a class of retirement income products, allow equity market exposure for a policyholder's retirement fund with electable additional guarantees to limit the downside risk of the market. Management fees and guarantee insurance fees are charged respectively for the market exposure and for the protect…
A new approach optimizes weights in DLP for better risk-adjusted performance.
Evolutionary algorithm finds optimal pixel perturbations to improve neural network generalization.
In many applications, such as economics, operations research and reinforcement learning, one often needs to estimate a multivariate regression function f subject to a convexity constraint. For example, in sequential decision processes the value of a state under optimal subsequent decisions may be known to be convex or …
We construct a binomial model for a guaranteed minimum withdrawal benefit (GMWB) rider to a variable annuity (VA) under optimal policyholder behaviour. The binomial model results in explicitly formulated perfect hedging strategies funded using only periodic fee income. We consider the separate perspectives of the insur…
Paper detects anomalous edges in social networks using edge exchangeability.
We study parallel surfaces and dual surfaces of cuspidal edges. We give concrete forms of principal curvature and principal direction for cuspidal edges. Moreover, we define ridge points for cuspidal edges by using those. We clarify relations between singularities of parallel and dual surfaces and differential geometri…
OL4EL optimizes edge learning on resource-constrained servers.
New GPs model edge functions on complex networks, capturing divergence and curl.
In L^3, cuspidal edges can have bounded mean curvature under specific conditions.
Along cuspidal edge singularities on a given surface in Euclidean 3-space, which can be parametrized by a regular space curve, a unit normal vector field is well-defined as a smooth vector field of the surface. A cuspidal edge singular point is called generic if the osculating plane of the cuspidal edge (as a regul…
Bundling of graph edges (node-to-node connections) is a common technique to enhance visibility of overall trends in the edge structure of a large graph layout, and a large variety of bundling algorithms have been proposed. However, with strong bundling, it becomes hard to identify origins and destinations of individual…
Edge augmentation connects disconnected graphs by elevating eigenvalues.
We prove several results about chordal graphs and weighted chordal graphs by focusing on exposed edges. These are edges that are properly contained in a single maximal complete subgraph. This leads to a characterization of chordal graphs via deletions of a sequence of exposed edges from a complete graph. Most interesti…
Under what conditions is an edge present in a social network at time t likely to decay or persist by some future time t + Delta(t)? Previous research addressing this issue suggests that the network range of the people involved in the edge, the extent to which the edge is embedded in a surrounding structure, and the age…
In the emerging advancement in the branch of autonomous robotics, the ability of a robot to efficiently localize and construct maps of its surrounding is crucial. This paper deals with utilizing thermal-infrared cameras, as opposed to conventional cameras as the primary sensor to capture images of the robot's surroundi…
Study of cuspidal edges on focal surfaces of regular surfaces.
Method certifies edge predictions with cloud-level reliability.
Defense against user shilling attacks in collaborative filtering using edge reweighting.
This paper is on the normal approximation of singular subspaces when the noise matrix has i.i.d. entries. Our contributions are three-fold. First, we derive an explicit representation formula of the empirical spectral projectors. The formula is neat and holds for deterministic matrix perturbations. Second, we calculate…
Strategic feature selection in high-stakes domains like healthcare.
A hybrid neural network optimizes AI deployment on edge and cloud for energy efficiency.
CoMGNN models heterogeneous graphs with evolving nodes and edges.
Study relates Gaussian curvature signs to cuspidal edge types and geometric invariants.
This paper proposes a method to learn graph representations by partitioning edges into communities.
New research finds six bipartite intrinsically knotted graphs with 23 edges.
Johnson, Kidwell, and Michael showed that intrinsically knotted graphs have at least 21 edges. Also it is known that K7 and the thirteen graphs obtained from K7 by rY moves are intrinsically knotted graphs with 21 edges. We prove that these 14 graphs are the only intrinsically knotted graphs with 21 edges.
Graph neural networks improve with edge similarity constraints in RNA structure analysis.
This paper optimizes AI inference on edge devices with reduced communication and computation costs.
On-device federated learning updates edge models by exchanging trained results.
The study proves poor ideal three-edge triangulations are minimal for certain 3-manifolds.
Study on planar graph braid groups' second homology.
Previous work in network analysis has focused on modeling the mixed-memberships of node roles in the graph, but not the roles of edges. We introduce the edge role discovery problem and present a generalizable framework for learning and extracting edge roles from arbitrary graphs automatically. Furthermore, while existi…
The paper provides conditions for realizing graphs and polytopes with specified edge lengths.
Edge features contain important information about graphs. However, current state-of-the-art neural network models designed for graph learning, e.g. graph convolutional networks (GCN) and graph attention networks (GAT), adequately utilize edge features, especially multi-dimensional edge features. In this paper, we build…
A known failing of many popular random graph models is that the Aldous-Hoover Theorem guarantees these graphs are dense with probability one; that is, the number of edges grows quadratically with the number of nodes. This behavior is considered unrealistic in observed graphs. We define a notion of edge exchangeability …
Two complete graphs are connected by adding some edges. The obtained graph is called the gluing graph. The more we add edges, the larger the Ricci curvature on it becomes. We calculate the Ricci curvature of each edge on the gluing graph and obtain the least number of edges that result in the gluing graph having positi…
SAM improves generalization by operating near the edge of stability.
Paper proves edge-connectivity equals minimum degree for graphs with non-negative curvature.
New method constructs tilings of the plane using directed edges and alignments.