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,742 papers · 148 categories

Trend · papers per month

2955908851,180 · Jun 202019922001200920172026
48 results for CROWN method

Efficiently verifies neural networks by handling neuron splits, improving speed and accuracy.

problem Handling neuron split constraints in incomplete neural network verification.
method β-CROWN, which optimizes parameters β to encode neuron splits and uses them in bound propagation.
result β-CROWN significantly speeds up verification while maintaining high accuracy.

We consider harmonic diffeomorphisms to a fixed hyperbolic target YY, from a family of domain Riemann surfaces degenerating along a Teichmüller ray. We use the work of Minsky to show that there is a limiting harmonic map from the conformal limit of the Teichmüller ray, to a crowned hyperbolic surface. The target surfa…

2018-05-10abs ↗pdf ↗

Let Ξ\,Ξ\, be the crown domain associated with a non-compact irreducible hermitian symmetric space G/K\,G/K. We give an explicit description of the unique G\,G-invariant adapted hyper-Kähler structure on Ξ\,Ξ, \ i.\,e. \ compatible with the adapted complex structure Jad\,J_{ad}\, and with the G\,G-invariant Kähle…

2017-11-05abs ↗pdf ↗

Generalizes neural network verification by adding arbitrary cutting planes.

problem Handling general cutting plane constraints in neural network verification.
method Generalized bound propagation method (GCP-CROWN) that allows arbitrary cutting plane constraints.
result GCP-CROWN significantly improves neural network verification performance.

We use meromorphic quadratic differentials with higher order poles to parametrize the Teichmüller space of crowned hyperbolic surfaces. Such a surface is obtained on uniformizing a compact Riemann surface with marked points on its boundary components, and has non-compact ends with boundary cusps. This extends Wolf's pa…

2017-08-16abs ↗pdf ↗

The paper analyzes constrained optimal portfolios in high dimensions using novel statistical learning techniques.

problem Forming optimal portfolios with constraints in high-dimensional asset spaces.
method CROWN method integrating factor models with nodewise regression for estimation in large dimensions.
result Demonstrates estimation consistency and convergence rates for constrained portfolio weights, risk, and Sharpe Ratio.

SLIC-UAV monitors forest recovery using UAVs and machine learning.

problem Challenges in monitoring forest recovery, especially in logged tropical forests.
method Novel pipeline for UAV imagery analysis, combining crown labelling, species classification, and superpixel segmentation.
result SLIC-UAV achieves high accuracy in species mapping, from 79.3% to 90.5%.

The rapid growth of deep learning applications in real life is accompanied by severe safety concerns. To mitigate this uneasy phenomenon, much research has been done providing reliable evaluations of the fragility level in different deep neural networks. Apart from devising adversarial attacks, quantifiers that certify…

2019-12-02abs ↗pdf ↗

This paper studies deformations of hyperbolic surfaces with special structures.

problem Infinitesimal deformations of hyperbolic surfaces with boundary and ideal vertices.
method Description of the admissible cone of deformations in terms of the arc complex.
result Realization of the admissible cone and its faces as arc complexes for specific surface families.

We study the profitability of optimal mean reversion trading strategies in the US equity market. Different from regular pair trading practice, we apply maximum likelihood method to construct the optimal static pairs trading portfolio that best fits the Ornstein-Uhlenbeck process, and rigorously estimate the parameters.…

2016-02-18abs ↗pdf ↗

Let ΣΣ be a connected, oriented surface with punctures and negative Euler characteristic. We introduce wild globally hyperbolic anti-de Sitter structures on Σ×RΣ\times \mathbb{R} and provide two parameterisations of their deformation space: as a quotient of the product of two copies of the Teichmüller space of crowned …

2019-01-01abs ↗pdf ↗

A Morse 2-function is a generic smooth map from a manifold M of arbitrary finite dimension to a surface B. Its critical set maps to an immersed collection of cusped arcs in B. The aim of this paper is to explain exactly when it is possible to move these arcs around in B by a homotopy and to give a library of examples w…

2014-11-06abs ↗pdf ↗

A meromorphic projective structure on a punctured Riemann surface XPX\setminus P is determined, after fixing a standard projective structure on XX, by a meromorphic quadratic differential with poles of order three or more at each puncture in PP. In this article we prove the analogue of Thurston's grafting theorem for…

2019-04-08abs ↗pdf ↗

H. Weyl's proposal of 1918 for generalizing Riemannian geometry by local scale gauge (later called {\em Weyl geometry}) was motivated by mathematical, philosophical and physical considerations. It was the starting point of his unified field theory of electromagnetism and gravity. After getting disillusioned with this r…

2019-11-05abs ↗pdf ↗

The article explores causal structures in symmetric spaces and their relation to AQFT.

problem Understanding causal structures in symmetric spaces and their applications in AQFT.
method Classification of reductive causal symmetric spaces using Euler elements and 3-grading.
result Extraction of real Matsuki crowns and description of stabilizer groups of Euler elements.

Paper proposes faster certified robust training methods with short warmup.

problem Certified robust training methods require long warmup schedules, making training costly.
method Proposes three improvements: new weight initialization, BN, and regularization.
result Achieves 65.03% verified error on CIFAR-10 and 82.36% on TinyImageNet with short warmup.

IBP-R improves verified adversarial robustness with simple, effective interval bound propagation.

problem Improving verifiability of adversarially trained networks.
method Coupling adversarial attacks with interval bound propagation for minimized verification gap.
result State-of-the-art verified robustness-accuracy trade-offs for small perturbations on CIFAR-10.

ECBMs unify concept-based interpretations in deep learning models.

problem Suboptimal final accuracy and lack of concept interaction and conditional dependencies.
method ECBMs use a set of neural networks to define joint energy, enabling concept correction and conditional dependency quantification.
result ECBMs achieve higher accuracy and richer concept interpretations compared to state-of-the-art methods.

Automates perturbation analysis for neural networks, enabling certified robustness on complex architectures.

problem Limited applicability of existing perturbation analysis methods to complex neural network architectures.
method Developed an automatic framework to generalize LiRPA algorithms to any neural network structure, enabling loss fusion and state-of-the-art certified defense results.
result Demonstrated LiRPA based certified defense on Tiny ImageNet and Downscaled ImageNet.

HYDRA prunes robust neural networks to improve both benign and adversarial robustness.

problem Lack of robustness against adversarial attacks and large neural network size in deep learning.
method HYDRA integrates pruning techniques with adversarial training and verifiable robust training objectives.
result HYDRA achieves compressed networks with state-of-the-art benign and robust accuracy.

Study modular geodesics and wedge domains in non-compactly causal symmetric spaces.

problem Understanding the geometric implementation of modular group in symmetric spaces.
method Analyzing the flow generated by Euler elements and their geometric properties.
result The wedge region W is connected and coincides with the observer domain under certain conditions.

We describe a novel optimization method for finite sums (such as empirical risk minimization problems) building on the recently introduced SAGA method. Our method achieves an accelerated convergence rate on strongly convex smooth problems. Our method has only one parameter (a step size), and is radically simpler than o…

2016-02-08abs ↗pdf ↗

A new method combines Laplace and Variational Bayes for scalable inference.

problem Complex models and large datasets make exact inference infeasible.
method Low-Rank Variational Bayes Correction (VBC) using Laplace method and Variational Bayes correction in a lower dimension.
result The method ensures scalability in both model complexity and data size.

In this paper, the author considers the numerical computation of CVA for large systems by Mote Carlo methods. He introduces two types of stochastic mesh methods for the computations of CVA. In the first method, stochastic mesh method is used to obtain the future value of the derivative contracts. In the second method, …

2015-10-15abs ↗pdf ↗

A comprehensive benchmark of 15 scRNA-seq imputation methods across various datasets and analyses.

problem Imputation of single-cell RNA sequencing data to recover latent transcriptional signals.
method Evaluation of 15 imputation methods across 30 datasets and 6 downstream analyses.
result Traditional methods generally outperform DL-based methods in scRNA-seq data analysis.