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

57114170227 · Jun 202019922001200920172026
48 results for Differential Complices

Mathematical method based on a direct or indirect analysis of growth rates is described. It is shown how simple assumptions and a relatively easy analysis can be used to describe mathematically complicated trends and to predict growth. Only rudimentary knowledge of calculus is required. Projected trajectories based on …

2017-04-27abs ↗pdf ↗

The concept of $\Zn$-supermanifold has been recently proposed as a natural generalization of classical ($\Zs$-graded) supergeometry, allowing for more complicated commutativity constraints. Here we continue the study of $\Zn$-supergeometry by developing the foundations of differential calculus on $\Zn$-supermanifolds.

2016-08-02abs ↗pdf ↗

Abstract: Extends geometric concepts to generalized tangent bundle and describes flows.

problem Extend classical geometric notions to generalized geometry.
method Develops differential complexes and generalized connections on the generalized tangent bundle.
result Describes geometric flows and their analogues in generalized geometry.

We outline in detail the general caloron correspondence for the group of automorphisms of an arbitrary principal GG-bundle QQ over a manifold XX, including the case of the gauge group of QQ. These results are used to define characteristic classes of gauge group bundles. Explicit but complicated differential form re…

2011-05-04abs ↗pdf ↗

EI-MTD defends edge intelligence against adversarial attacks with dynamic scheduling.

problem Adversarial attacks on edge intelligence models.
method EI-MTD uses differential knowledge distillation to create robust member models and a dynamic scheduling policy based on a Bayesian Stackelberg game.
result EI-MTD effectively protects edge intelligence from black-box adversarial attacks.

The Killing operator on a Riemannian manifold is a linear differential operator on vector fields whose kernel provides the infinitesimal Riemannian symmetries. The Killing operator is best understood in terms of its prolongation, which entails some simple tensor identities. These simple identities can be viewed as aris…

2010-06-08abs ↗pdf ↗

We define a differential graded algebra associated to Legendrian knots in Seifert fibered spaces with transverse contact structures. This construction is distinguished from other combinatorial realizations of contact homology invariants by the existence of orbifold points in the Reeb orbit space of the contact manifold…

2010-12-11abs ↗pdf ↗

This paper introduces a spline-based method for nonparametric ADVI that handles complex posterior distributions.

problem Learning complex posterior distributions with skewness, multimodality, and bounded support.
method Develops a spline-based nonparametric approximation approach for ADVI.
result Establishes the asymptotic consistency of the derived lower bound for importance weighted autoencoder.

The fundamental tool in the classification of orthogonal coordinate systems in which the Hamilton-Jacobi and other prominent equations can be solved by a separation of variables are second order Killing tensors which satisfy the Nijenhuis integrability conditions. The latter are a system of three non-linear partial dif…

2015-02-26abs ↗pdf ↗

Data that is gathered adaptively --- via bandit algorithms, for example --- exhibits bias. This is true both when gathering simple numeric valued data --- the empirical means kept track of by stochastic bandit algorithms are biased downwards --- and when gathering more complicated data --- running hypothesis tests on c…

2018-06-06abs ↗pdf ↗

MissNODAG learns cyclic causal graphs from incomplete data.

problem Causal discovery in systems with feedback loops and missing data.
method Differentiable framework integrating additive noise model and expectation-maximization.
result MissNODAG uncovers cyclic structures and missingness mechanisms from partially observed data.

Study describes severe dengue ICU patients in Brazil, 2012-2024.

problem Characterize severe dengue ICU patients and identify risk factors.
method Prospective study, descriptive statistics, logistic regression, machine learning.
result Advanced age, comorbidities, leukocytes, and platelets are significant risk factors for complications.

Deep learning models predict postoperative complications more accurately than random forests.

problem Predicting postoperative complications to inform patient care decisions.
method Multi-task deep neural networks integrating intraoperative physiological data.
result Deep learning models improved prediction accuracy and provided interpretable risk factors.

A Poincaré-Hopf Theorem for line fields with point singularities on orientable surfaces can be found Hopf's 1956 Lecture Notes on Differential Geometry. In 1955 Markus presented such a theorem in all dimensions, but Markus' statement only holds in even dimensions 2k42k \geq 4. In 1984 Jänich presented a Poincaré-Hopf th…

2016-12-13abs ↗pdf ↗

Hamiltonian Monte Carlo (HMC) is arguably the dominant statistical inference algorithm used in most popular "first-order differentiable" Probabilistic Programming Languages (PPLs). However, the fact that HMC uses derivative information causes complications when the target distribution is non-differentiable with respect…

2018-04-07abs ↗pdf ↗

Epileptic seizure activity shows complicated dynamics in both space and time. To understand the evolution and propagation of seizures spatially extended sets of data need to be analysed. We have previously described an efficient filtering scheme using variational Laplace that can be used in the Dynamic Causal Modelling…

2017-05-20abs ↗pdf ↗

Most known examples of doubly periodic minimal surfaces in R3\mathbb{R}^3 with parallel ends limit as a foliation of R3\mathbb{R}^3 by horizontal noded planes, with the location of the nodes satisfying a set of balance equations. Conversely, for each set of points providing a balanced configuration, there is a correspo…

2016-04-26abs ↗pdf ↗

Paper proposes a differentially private test for joint dependence among random vectors.

problem Detecting joint dependence among sensitive data while maintaining privacy.
method Differentially private permutation methodology for dHSIC test.
result Proposed test attains minimax optimal power across privacy regimes.

There has been much recent, exciting work on combining the complementary strengths of latent variable models and deep learning. Latent variable modeling makes it easy to explicitly specify model constraints through conditional independence properties, while deep learning makes it possible to parameterize these conditio…

2018-12-17abs ↗pdf ↗

Deep learning models are often trained on datasets that contain sensitive information such as individuals' shopping transactions, personal contacts, and medical records. An increasingly important line of work therefore has sought to train neural networks subject to privacy constraints that are specified by differential…

2019-11-26abs ↗pdf ↗

We solve the mean parametrization of von Mises-Fisher distribution.

problem No closed-form normalization function for mean parameters exists.
method Derived a second-order ODE for mean normalizer and provided approximations.
result Rapid evaluation of densities and natural parameters in terms of mean parameters.

Paper improves privacy bounds for shuffle model using novel numerical techniques.

problem Improving privacy guarantees in the shuffle model of differential privacy.
method Develops and evaluates numerical techniques for tighter (ε,δ)(\varepsilon,δ)-differential privacy bounds.
result Accurately evaluates privacy loss distribution for adaptive compositions of shufflers.

Reliable training of generative adversarial networks (GANs) typically require massive datasets in order to model complicated distributions. However, in several applications, training samples obey invariances that are \textit{a priori} known; for example, in complex physics simulations, the training data obey universal …

2019-06-04abs ↗pdf ↗

FuDGE estimates differences between functional graphs in high-dimensional settings.

problem Estimating differences between two undirected functional graphical models with shared structures.
method FuDGE: A method that directly estimates the functional differential graph without first estimating individual graphs.
result FuDGE consistently estimates the functional differential graph in high-dimensional settings.

Iteratively reweighted least squares (IRLS) is a widely-used method in machine learning to estimate the parameters in the generalised linear models. In particular, IRLS for L1 minimisation under the linear model provides a closed-form solution in each step, which is a simple multiplication between the inverse of the we…

2016-05-24abs ↗pdf ↗

Asynchronous stochastic gradient descent (ASGD) is a popular parallel optimization algorithm in machine learning. Most theoretical analysis on ASGD take a discrete view and prove upper bounds for their convergence rates. However, the discrete view has its intrinsic limitations: there is no characterization of the optim…

2018-05-08abs ↗pdf ↗

Partial connections are (singular) differential systems generalizing classical connections on principal bundles, yielding analogous decompositions for manifolds with nonfree group actions. Connection forms are interpreted as maps determining projections of the tangent bundle onto the partial connection; this approach e…

2003-09-14abs ↗pdf ↗

Let MM be a 3-manifold with torus boundary components T1T_1 and T2T_2. Let φ ⁣:T1T2φ\colon T_1 \to T_2 be a homeomorphism, MφM_φ the manifold obtained from MM by gluing T1T_1 to T2T_2 via the map φφ, and TT the image of T1T_1 in MφM_φ. We show that if φφ is "sufficiently complicated" then any incompressible or strongly …

2009-11-27abs ↗pdf ↗

Solar improves variable selection in high-dimensional data with complicated dependence structures.

problem Variable selection in ultrahigh dimensional data with severe multicollinearity and grouping effect issues.
method Subsample-ordered least angle regression (Solar) for ultrahigh dimensional data.
result Solar yields substantial improvements in sparsity, stability, and accuracy of variable selection compared to traditional methods.

How can prior knowledge on the transformation invariances of a domain be incorporated into the architecture of a neural network? We propose Equivariant Transformers (ETs), a family of differentiable image-to-image mappings that improve the robustness of models towards pre-defined continuous transformation groups. Throu…

2019-01-25abs ↗pdf ↗