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

Trend · papers per month

23456890 · Jun 202019922001200920172026
48 results for wildly unsupervised

Butterfly tackles wild unsupervised domain adaptation with noisy labeled data.

problem Training classifiers with noisy labeled data from source domain and unlabeled data from target domain.
method Butterfly framework, maintaining four deep networks for simultaneous adaptations.
result Butterfly significantly outperforms existing methods in wild unsupervised domain adaptation.

In this article we prove that, for an oriented PL nn-manifold MM with mm boundary components and d0Nd_0\in \mathbb N, there exist mutually disjoint closed Euclidean balls and a K\mathsf K-quasiregular mapping MSnint(B1Bm)M \to \mathbb S^n \setminus \mathrm{int}(B_1\cup \cdots \cup B_m) of degree at least d0d_0. The result is …

2019-04-19abs ↗pdf ↗

In the current environment of financial distress, many governments are likely to soon become major holders of financial assets, but the policy debate focuses only on the likelihood and extent of short-term market stabilization. This paper shows that government intervention and propping up are likely to lead to long-ter…

2010-02-11abs ↗pdf ↗

The author has elsewhere given a complete classification of those compact oriented Einstein 4-manifolds on which the self-dual Weyl curvature is everywhere positive in the direction of some self-dual harmonic 2-form. In this article, similar results are obtained when the self-dual Weyl curvature is everywhere non-negat…

2019-03-03abs ↗pdf ↗

Paper defines predictive multiplicity and measures its severity in classification problems.

problem Challenges in machine learning due to competing models with conflicting predictions.
method Formal measures and integer programming tools for linear classification problems.
result Real-world datasets may admit competing models with wildly conflicting predictions.

Deep generative models have been wildly successful at learning coherent latent representations for continuous data such as video and audio. However, generative modeling of discrete data such as arithmetic expressions and molecular structures still poses significant challenges. Crucially, state-of-the-art methods often …

2017-03-06abs ↗pdf ↗

A risk-neutral method is always used to price and hedge contingent claims in complete market, but another method based on utility maximization or risk minimization is wildly used in more general case. One can find all kinds of special risk measure in literature. In this paper, instead of using market modified risk meas…

2011-03-05abs ↗pdf ↗

The study extends Huber's theorem to higher dimensions with curvature constraints.

problem Extending Huber's theorem to higher dimensions with curvature constraints.
method Analyzing a specific class of Riemannian manifolds with bounded radial sectional curvature.
result The existence of a limit on the volume of metric balls and implications for the topology of the manifold.

We extend in a minimal way the stylized model introduced in in "Tipping Points in Macroeconomic Agent Based Models" [JEDC 50, 29-61 (2015)], with the aim of investigating the role and efficacy of monetary policy of a `Central Bank' that sets the interest rate such as to steer the economy towards a prescribed inflation …

2015-01-02abs ↗pdf ↗

Revisits the connection between neural networks and the Kolmogorov-Arnold theorem.

problem Explains the limitations of using the Kolmogorov-Arnold theorem to explain neural networks with multiple hidden layers.
method Derives modifications of the Kolmogorov-Arnold representation that transfer smoothness properties to the outer function and can be well approximated by ReLU networks.
result Shows that a deep neural network with most layers approximating the interior function is a more natural interpretation of the Kolmogorov-Arnold representation.

We develop a model for contagion in reinsurance networks by which primary insurers' losses are spread through the network. Our model handles general reinsurance contracts, such as typical excess of loss contracts. We show that simpler models existing in the literature--namely proportional reinsurance--greatly underesti…

2018-05-30abs ↗pdf ↗

Unsupervised classification methods learn a discriminative classifier from unlabeled data, which has been proven to be an effective way of simultaneously clustering the data and training a classifier from the data. Various unsupervised classification methods obtain appealing results by the classifiers learned in an uns…

2012-10-02abs ↗pdf ↗

Improves deep RL agents' generalization to unseen environments.

problem Deep RL agents struggle to adapt to new environments.
method Information Bottleneck regularization and annealing-based optimization.
result Agents can generalize to test parameters more than 10 standard deviations away from training.

Causal influence measures for machine learnt classifiers shed light on the reasons behind classification, and aid in identifying influential input features and revealing their biases. However, such analyses involve evaluating the classifier using datapoints that may be atypical of its training distribution. Standard me…

2018-03-28abs ↗pdf ↗

We consider orientation-preserving actions of a finite group G on the 3-sphere S^3 (and also on Euclidean space R^3). By the geometrization of finite group actions on 3-manifolds, if such an action is smooth then it is conjugate to an orthogonal action, and in particular G is isomorphic to a subgroup of the orthogonal …

2016-06-24abs ↗pdf ↗

Study on market instability in multi-agent trading with price impact and transaction costs.

problem Analyzing market instability in multi-agent trading with price impact and transaction costs.
method Analytical and numerical methods to study Nash equilibria and stability conditions.
result Conditions on model parameters determine market stability, including scaling of market impact and transaction cost.

Unsupervised machine translation---i.e., not assuming any cross-lingual supervision signal, whether a dictionary, translations, or comparable corpora---seems impossible, but nevertheless, Lample et al. (2018) recently proposed a fully unsupervised machine translation (MT) model. The model relies heavily on an adversari…

2018-05-09abs ↗pdf ↗

This research shows unsupervised GANs can perform object segmentation without labels.

problem Performing object segmentation without pixel or image-level labels.
method Used large-scale unsupervised GAN models to differentiate foreground from background.
result Demonstrated high-quality saliency masks and new state-of-the-art performance.

Unified framework for analyzing neural networks trained by gradient descent.

problem Lack of generalizable guarantees for neural networks trained by gradient descent.
method Proxy convexity and proxy Polyak-Lojasiewicz inequalities.
result Unified guarantees for neural networks trained by gradient descent.

Paper proposes a novel unsupervised feature selection method using K-means and ADMM.

problem Finding a subset of features for high-dimensional unsupervised learning problems.
method Developed K-means Derived Unsupervised Feature Selection (K-means UFS) using ADMM to solve NP-hard optimization.
result K-means UFS outperforms baselines in feature selection for clustering.

Unsupervised ensemble classification for dependent data.

problem Classifying data with dependencies using multiple classifiers.
method Developed algorithms for sequential and networked data dependencies, using moment matching and Expectation Maximization.
result Improved classification performance on synthetic and real datasets.

Paper presents a workflow for reliable unsupervised learning in science.

problem Lack of standardization in unsupervised learning workflows for reproducible scientific discoveries.
method Structured workflow including data preparation, modeling, validation, and communication.
result Illustrates the importance of validation in unsupervised learning.

We introduce a framework to leverage knowledge acquired from a repository of (heterogeneous) supervised datasets to new unsupervised datasets. Our perspective avoids the subjectivity inherent in unsupervised learning by reducing it to supervised learning, and provides a principled way to evaluate unsupervised algorithm…

2017-09-14abs ↗pdf ↗

The paper shows how integrating categorical semantics can enhance unsupervised domain translation.

problem Improving unsupervised domain translation between perceptually different domains.
method Learning invariant categorical semantic features in an unsupervised manner and conditioning them on the style encoder.
result Conditioning the style encoder on learned categorical semantics improves translation and stylization.

A new ML method predicts long-time-step molecular dynamics, preserving symplectic and time-reversible properties.

problem Limited computational efficiency in long-time-step molecular dynamics simulations.
method Learning data-driven structure-preserving maps to generate long time-step classical dynamics.
result The method eliminates artifacts like lack of energy conservation and loss of equipartition.

Proposes a new model for unsupervised clustering with latent variables.

problem The challenge of unsupervised clustering in machine learning.
method Clustered Generator Model with continuous and discrete latent variables.
result Achieves competitive unsupervised clustering accuracy and disentangled latent representations.

Recently, multilayer bootstrap network (MBN) has demonstrated promising performance in unsupervised dimensionality reduction. It can learn compact representations in standard data sets, i.e. MNIST and RCV1. However, as a bootstrap method, the prediction complexity of MBN is high. In this paper, we propose an unsupervis…

2015-03-22abs ↗pdf ↗

Study proposes using auxiliary classification to improve unsupervised anomaly detection.

problem Challenging anomaly detection in high-dimensional data.
method Use of an auxiliary classification task to extract features from unlabelled data by supervised learning.
result Our feature learning approach yields best anomaly detection performance.

Paper summarizes unsupervised learning challenges for disentangled representations.

problem Unsupervised learning of disentangled representations without inductive biases.
method Theoretical and practical analysis of existing approaches.
result Unsupervised disentanglement is fundamentally impossible without inductive biases.

This paper proves the theoretical advantage of unsupervised pretraining for machine learning tasks.

problem Understanding why unsupervised pretraining helps in machine learning tasks.
method A generic framework using Maximum Likelihood Estimation (MLE) for unsupervised pretraining and Empirical Risk Minimization (ERM) for downstream tasks.
result Proves an excess risk of ildeO(CΦ/m+CΨ/n) ilde{\mathcal{O}}(\sqrt{\mathcal{C}_Φ/m} + \sqrt{\mathcal{C}_Ψ/n}) for downstream tasks under mild conditions.