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.
SNAP improves robust computation by emphasizing trustworthy items and downweighting outliers.
We propose a semismooth Newton algorithm for pathwise optimization (SNAP) for the LASSO and Enet in sparse, high-dimensional linear regression. SNAP is derived from a suitable formulation of the KKT conditions based on Newton derivatives. It solves the semismooth KKT equations efficiently by actively and continuously s…
SnAp approximates RTRL for online training of sparse recurrent networks.
This paper proposes low-complexity algorithms for finding approximate second-order stationary points (SOSPs) of problems with smooth non-convex objective and linear constraints. While finding (approximate) SOSPs is computationally intractable, we first show that generic instances of the problem can be solved efficientl…
Enhances robustness of AT frameworks to multiple perturbations without increasing training complexity.
SNAP efficiently identifies causal effects without needing full graph learning.
A new deep learning model improves asset pricing predictions.
In order to study a one-dimensional analogue of the spontaneous curvature model for two-component lipid bilayer membranes we consider planar curves that are made of a material with two phases. Each phase induces a preferred curvature to the curve, and these curvatures as well as phase boundaries may lead to the develop…
Large and stable indices of the world wide stock markets such as NYSE and SP 500 together with NASDAQ -- the index representing markets of new trends, and WIG -- the index of the local stock market of Eastern Europe, are considered. Due to the relation between artificial insymmetrised patterns (AIP) and time series, st…
This paper describes a general algorithm for finding the commensurator of a non-arithmetic cusped hyperbolic manifold, and for deciding when two such manifolds are commensurable. The method is based on some elementary observations regarding horosphere packings and canonical cell decompositions. For example, we use this…
Graph spectra have been successfully used to classify network types, compute the similarity between graphs, and determine the number of communities in a network. For large graphs, where an eigen-decomposition is infeasible, iterative moment matched approximations to the spectra and kernel smoothing are typically used. …
The computer program SnapPea can approximate whether or not a three manifold whose boundary consists of tori has a complete hyperbolic structure, but it can not prove conclusively that this is so. This article provides a method for proving that such a manifold has a complete hyperbolic structure based on the approximat…
Novel bistable structures made from four-bar linkages, proving existence and construction.
Mixed-SCORE+ improves community detection in weak signal networks.
The paper optimizes RF training by improving tree building algorithms and CPU optimizations.
Introduces deep learning for graphs in a tutorial format.
Study optimal and equitable encouragement policies for treatment adherence.
The fashion industry is establishing its presence on a number of visual-centric social media like Instagram. This creates an interesting clash as fashion brands that have traditionally practiced highly creative and editorialized image marketing now have to engage with people on the platform that epitomizes impromptu, r…
Paper proposes methods to localize sources in WSNs without knowing sensor parameters.
Stochastic approximation is one of the effective approach to deal with the large-scale machine learning problems and the recent research has focused on reduction of variance, caused by the noisy approximations of the gradients. In this paper, we have proposed novel variants of SAAG-I and II (Stochastic Average Adjusted…
The paper proposes a method to model non-smooth functions using clustering, classification, and Gaussian process modeling.
In this paper we enumerate and classify the ``simplest'' pairs (M,G) where M is a closed orientable 3-manifold and G is a trivalent graph embedded in M. To enumerate the pairs we use a variation of Matveev's definition of complexity for 3-manifolds, and we consider only (0,1,2)-irreducible pairs, namely pairs (M,G) suc…
This is the second in a series of papers in which we investigate ideal triangulations of the interiors of compact 3-manifolds with tori or Klein bottle boundaries. Such triangulations have been used with great effect, following the pioneering work of Thurston. Ideal triangulations are the basis of the computer program …
The study characterizes spacetime and modified gravity models using projective curvature tensor.
Bayesian Transformer improves probabilistic load forecasting with calibrated uncertainty estimates.
Study finds optimal learning rate schedules for sub-100M quantization-aware training across bit-widths.