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.
Study shows priors are crucial for accurate causal learning from unlabeled data.
New MRI method maps tissue parameters more accurately by ignoring voxel independence.
Type system captures CI relationships for probabilistic models.
Develops methods for constructing likelihoods and priors for Bayesian networks.
We generalize the classical Lie results on a basis of differential invariants for a one-parameter group of local transformations to the case of arbitrary number of independent and dependent variables. It is proved that if universal invariant of a one-parameter group is known then a complete set of functionally independ…
Constructs initial data for multiple black holes with specified ADM parameters.
We study the sample complexity of learning neural networks, by providing new bounds on their Rademacher complexity assuming norm constraints on the parameter matrix of each layer. Compared to previous work, these complexity bounds have improved dependence on the network depth, and under some additional assumptions, are…
Can we use deep learning to predict when deep learning works? Our results suggest the affirmative. We created a dataset by training 13,500 neural networks with different architectures, on different variations of spiral datasets, and using different optimization parameters. We used this dataset to train task-independent…
Bayesian neural networks learn graph structure with interpretable parameters.
The study reveals a persistent bias in the distribution of holonomy on compact hyperbolic 3-manifolds.
We investigate centers of a body (the closure of a bounded open set) defined as maximum points of potentials. In particular, we study centers defined by the Riesz potential and by Poisson's integral. These centers, in general, depend on parameters and move with respect to the parameters. We give a necessary and suffici…
LoRA-Curve connects independent LoRA optima through continuous low-loss valleys, improving Bayesian model averaging.
We show that the only parameter prior for complete Gaussian DAG models that satisfies global parameter independence, complete model equivalence, and some weak regularity assumptions, is the normal-Wishart distribution. Our analysis is based on the following new characterization of the Wishart distribution: let W be an …
Model estimates lung well-aerated volume from CT images, independent of patient and imaging parameters.
The group membership prediction (GMP) problem involves predicting whether or not a collection of instances share a certain semantic property. For instance, in kinship verification given a collection of images, the goal is to predict whether or not they share a {\it familial} relationship. In this context we propose a n…
This Ph.D. thesis is devoted to the constructions of Lagrangian formulation on Finsler and Kawaguchi manifolds. While Finsler geometry is a natural extension of Riemannian geometry, Kawaguchi geometry is the extension of Finsler geometry to higher order derivatives and to k-dimensional parameter space. The latter exten…
We develop and apply an approach for analyzing multi-curve data where each curve is driven by a latent state process. The state at any particular point determines a smooth function, forcing the individual curve to switch from one function to another. Thus each curve follows what we call a switching nonparametric regres…
Approach uses machine learning to identify structural modal parameters from output-only data.
Independent component analysis (ICA) is a powerful method for blind source separation based on the assumption that sources are statistically independent. Though ICA has proven useful and has been employed in many applications, complete statistical independence can be too restrictive an assumption in practice. Additiona…
A new VAE approach solves inverse problems without explicit inverse mapping.
Independent component analysis (ICA) is a widespread data exploration technique, where observed signals are modeled as linear mixtures of independent components. From a machine learning point of view, it amounts to a matrix factorization problem with a statistical independence criterion. Infomax is one of the most used…
Unified framework connects two market-making models, revealing their underlying equivalence.
We propose a novel approach for nonlinear regression using a two-layer neural network (NN) model structure with sparsity-favoring hierarchical priors on the network weights. We present an expectation propagation (EP) approach for approximate integration over the posterior distribution of the weights, the hierarchical s…
Log-linear models are the popular workhorses of analyzing contingency tables. A log-linear parameterization of an interaction model can be more expressive than a direct parameterization based on probabilities, leading to a powerful way of defining restrictions derived from marginal, conditional and context-specific ind…
The discovery of non-linear causal relationship under additive non-Gaussian noise models has attracted considerable attention recently because of their high flexibility. In this paper, we propose a novel causal inference algorithm called least-squares independence regression (LSIR). LSIR learns the additive noise model…
A new test for conditional independence in discretized data.
New method tracks time-varying parameters in data.
Paper introduces new regression methods for consistent estimation of biophysical parameters.
This research designs a data-driven partition to test independence between continuous variables.
Study algebraic relations of Vassiliev invariants for families of knots.
Considering the kinematics of the moving frame associated with a constant mean curvature surface immersed in S^3 we derive a linear problem with the spectral parameter corresponding to elliptic sinh-Gordon equation. The spectral parameter is related to the radius R of the sphere S^3. The application of the Sym formula …
Derives PDEs from data using manifold learning and neural networks.
The extension of the classical Bayesian penalized spline method to inference on vector-valued functions is considered, with an emphasis on characterizing the suitability of the method for general application.We show that the standard quadratic penalty is exactly analogous to the energy of a stretched string, with the p…
New findings on Malgrange-Galois groupoid for Painlevé VI equation parameters.
We provide a theoretical treatment of over-specified Gaussian mixtures of experts with covariate-free gating networks. We establish the convergence rates of the maximum likelihood estimation (MLE) for these models. Our proof technique is based on a novel notion of \emph{algebraic independence} of the expert functions. …
NKN deep neural network learns governing equations and classifies images.
Deep ReLU networks generalize well with few parameters.
We prove that if the Black-Scholes formula holds with the spot volatility for call options with all strikes, then the volatility parameter is constant. The proof relies some result on semimartingales (Theorem 2) of independent interest.
We introduce a new deep convolutional neural network, CrescendoNet, by stacking simple building blocks without residual connections. Each Crescendo block contains independent convolution paths with increased depths. The numbers of convolution layers and parameters are only increased linearly in Crescendo blocks. In exp…
A graph neural network transforms features in each vertex's neighborhood into a vector representation of the vertex. Afterward, each vertex's representation is used independently for predicting its label. This standard pipeline implicitly assumes that vertex labels are conditionally independent given their neighborhood…
We give a new, very general, formulation of the compressed sensing problem in terms of coordinate projections of an analytic variety, and derive sufficient sampling rates for signal reconstruction. Our bounds are linear in the coherence of the signal space, a geometric parameter independent of the specific signal and m…
New AI-block models for clustering high-dimensional variables based on maxima of random processes.
Closed-form formulas for path-independent options in a specific Lévy model.
The degree- Chow parameters of a Boolean function are its degree at most Fourier coefficients. It is well-known that degree- Chow parameters uniquely characterize degree- polynomial threshold functions (PTFs) within the space of all bounded functions. In this paper, we prove …
New algorithm reduces regret from sqrt(T) to polylog(T) in stochastic contextual linear bandits.
In Part II of this paper, we concentrate our analysis on the price dynamical model with the moving average rules developed in Part I of this paper. By decomposing the excessive demand function, we reveal that it is the interplay between trend-following and contrarian actions that generates the price chaos, and give par…
We propose a simple and easy to implement neural network compression algorithm that achieves results competitive with more complicated state-of-the-art methods. The key idea is to modify the original optimization problem by adding K independent Gaussian priors (corresponding to the k-means objective) over the network p…
We discuss two parameterizations of models for marginal independencies for discrete distributions which are representable by bi-directed graph models, under the global Markov property. Such models are useful data analytic tools especially if used in combination with other graphical models. The first parameterization, i…