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

4999148197 · Jun 202019922001200920172026
48 results for vague prior

New model of vague knowledge without strict partitions or transitivity.

problem Standard economic models of information fail to capture real-world vague knowledge.
method Relaxing assumptions of transitivity and partition structure to formalize vague knowledge.
result Vague knowledge can distinguish some states but not partition the state space.

Analysts use vague language in reports to convey useful information about future payoffs.

problem Lack of precise numerical forecasts in analyst reports.
method Empirical analysis of analyst reports to assess the predictive power of linguistic tone.
result The textual tone of analyst reports has predictive power for forecast errors and subsequent revisions, especially when language is vague and uncertainty is high.

In this paper, we derive a Bayesian model order selection rule by using the exponentially embedded family method, termed Bayesian EEF. Unlike many other Bayesian model selection methods, the Bayesian EEF can use vague proper priors and improper noninformative priors to be objective in the elicitation of parameter prior…

2017-03-30abs ↗pdf ↗

We discuss fun problems, vaguely related to notions and theorems of a course in differential geometry. This paper can be regarded as a weekend "treasure chest" supplementing the course weekday lecture notes. The problems and solutions are not original, while their relation to the course might be so.

2019-12-12abs ↗pdf ↗

Proposes using prior variable importance information in high-dimensional regression.

problem Using vague prior information on variable importance in high-dimensional settings.
method Fit a sequence of models indicated by the prior importance orderings, using ridge or Lasso regression.
result Cross-validation can select the best estimator from a sequence of models, with a logarithmic cost compared to the unknown best.

Bayesian deep learning improves neural network accuracy and generalization.

problem Improving accuracy and calibration of deep neural networks.
method Bayesian marginalization and deep ensembles to approximate marginalization, and tempering for calibrating predictive distributions.
result Bayesian approaches improve deep neural networks' accuracy and generalization.

In shape analysis, the concept of shape spaces has always been vague, requiring a case-by-case approach for every new type of shape. In this paper, we give a general definition for an abstract space of shapes in a manifold. This notion encompasses every shape space studied so far in the literature, and offers a rigorou…

2015-04-07abs ↗pdf ↗

Deep neural networks (DNNs) are known as black-box models. In other words, it is difficult to interpret the internal state of the model. Improving the interpretability of DNNs is one of the hot research topics. However, at present, the definition of interpretability for DNNs is vague, and the question of what is a high…

2019-09-12abs ↗pdf ↗

QLSTM outperforms LSTM in predicting KSE 100 index movements.

problem Predicting stock market movement in uncertain economic conditions.
method Used LSTM and QLSTM models on monthly data of economic indicators.
result QLSTM provided more accurate predictions of KSE 100 index values.

In an earlier paper we introduced rectangular diagrams of surfaces and showed that any isotopy class of a surface in the three-sphere can be presented by a rectangular diagram. Here we study transformations of those diagrams and introduce moves that allow transition between diagrams representing isotopic surfaces. We a…

2017-12-18abs ↗pdf ↗

A complex-valued convolutional network (convnet) implements the repeated application of the following composition of three operations, recursively applying the composition to an input vector of nonnegative real numbers: (1) convolution with complex-valued vectors followed by (2) taking the absolute value of every entry…

2015-03-11abs ↗pdf ↗

New framework shows ERM is optimal for both interpolation and extrapolation in domain generalization.

problem Formalizing and solving the challenges of domain generalization.
method Reformulated domain generalization as an online game between a risk-minimizing player and an adversary.
result ERM is minimax-optimal for both interpolation and extrapolation in domain generalization.

Study finds no significant difference in neural network weights with quantum random numbers.

problem Effects of biased quantum random numbers on neural network initialization.
method Empirical study using quantum hardware and classical pseudo-random numbers.
result No statistically significant difference found between quantum random numbers and other types.

The paper tackles model collapse in GPLVMs by improving kernel flexibility and projection variance.

problem Model collapse in GPLVMs leading to vague latent representations.
method Theoretical analysis of projection variance, integration of SM and RFF kernels, and variational inference.
result The advisedRFLVM outperforms competing models in informative latent representations and missing data imputation.

Semantic code search is the task of retrieving relevant code given a natural language query. While related to other information retrieval tasks, it requires bridging the gap between the language used in code (often abbreviated and highly technical) and natural language more suitable to describe vague concepts and ideas…

2019-09-20abs ↗pdf ↗

Review of uncertainty representation methods in risk management.

problem Inadequate consideration of uncertainty in risk management.
method Systematic literature review of 370 publications.
result Probabilistic methods are predominant, but fuzzy and evidence-based approaches are also useful.

We introduce a simple combinatorial way, which we call a rectangular diagram of a surface, to represent a surface in the three-sphere. It has a particularly nice relation to the standard contact structure on S3\mathbb S^3 and to rectangular diagrams of links. By using rectangular diagrams of surfaces we are going, in p…

2016-06-10abs ↗pdf ↗

Paper proves convergence of warped product manifolds to a nonnegative scalar curvature limit.

problem Proving convergence of sequences of manifolds with nonnegative scalar curvature.
method Warped product manifolds with diverging circular fibers, proving convergence in W1,pW^{1,p} sense.
result Sequence converges to an extreme limit space with nonnegative scalar curvature.

Paper studies identifiability and stability of drifting fields in generative modeling.

problem Identify and stabilize drifting fields in generative modeling.
method Introduces companion-elliptic kernel families to address limitations of Laplace kernel.
result Establishes field identifiability and demonstrates scalar observables for weak convergence.

The paper explores identifiability and stability in drifting fields using companion-elliptic kernels.

problem Identifying and stabilizing drifting fields in generative modeling.
method Introduces companion-elliptic kernel families and analyzes their properties to address identifiability and stability issues.
result Established field identifiability for arbitrary Borel probability measures and demonstrated that field convergence alone does not guarantee weak convergence.

For non-smooth surfaces, the measure of Brownian loops is derived using the Polyakov-Alvarez formula.

problem Deriving the measure of Brownian loops on non-smooth surfaces.
method Using the Polyakov-Alvarez formula and heat kernel traces.
result The measure of Brownian loops on non-smooth surfaces is derived and shown to be uniform.

TadGAN detects anomalies in time series data using GANs and LSTM.

problem Challenges in detecting anomalies in time series data, especially without labeled data.
method TadGAN uses Generative Adversarial Networks (GANs) with LSTM Recurrent Neural Networks to capture temporal correlations and compute anomaly scores.
result TadGAN outperforms 8 baseline methods in most cases, achieving the highest averaged F1 score.

A new Weyl prior is proposed for Bayesian statistics, offering a more canonical choice for parameter α.

problem Choosing a prior distribution for Bayesian inference.
method Proposed a new Weyl prior based on the Weyl structure on a statistical manifold.
result The Weyl prior is a special case of the α-parallel prior with α = -n, where n is the dimension of the statistical manifold.

Informative Bayesian priors are often difficult to elicit, and when this is the case, modelers usually turn to noninformative or objective priors. However, objective priors such as the Jeffreys and reference priors are not tractable to derive for many models of interest. We address this issue by proposing techniques fo…

2017-04-04abs ↗pdf ↗

While Bayesian methods are praised for their ability to incorporate useful prior knowledge, in practice, convenient priors that allow for computationally cheap or tractable inference are commonly used. In this paper, we investigate the following question: for a given model, is it possible to compute an inference result…

2016-06-02abs ↗pdf ↗

Researchers derive exact priors for finite Bayesian neural networks.

problem Understanding non-Gaussian priors in finite Bayesian neural networks.
method Analytical derivation of function space priors for finite fully-connected feedforward networks.
result Exact solutions for priors of finite networks, including Meijer G-function for linear networks and mixtures for ReLU networks.

PRCD-MAP learns to trust imperfect priors in causal discovery, improving accuracy and robustness.

problem Tackles the brittle trade-off between blind trust and rejection of external priors in causal discovery.
method Proposes PRCD-MAP, a soft prior-consumption layer that assigns per-edge trust to imperfect priors and modulates regularization in a MAP objective.
result Enjoys a population-level safety guarantee and outperforms existing methods on real-world causal discovery tasks.

Bayesian metalearning improves performance in linear bandits with misspecified priors.

problem Improper priors lead to suboptimal performance in sequential decision-making.
method Proves performance bounds for metalearning priors in stochastic linear bandits and develops a metalearning algorithm.
result Metalearning can improve performance by learning the prior from multiple tasks.

The paper extends and applies a new shrinkage prior in Bayesian factor analysis.

problem Estimating the number of factors in sparse Bayesian factor analysis.
method Introduces and extends a generalized cumulative shrinkage process (CUSP) prior.
result Exchangeable spike-and-slab shrinkage priors imply increasing shrinkage as the column index increases.