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

51103154205 · Jun 202019922001200920172026
48 results for top-down classifiers

Efficient algorithm for evaluating hierarchical classification methods at multiple operating points.

problem Evaluating hierarchical classification methods at multiple operating points.
method Efficient algorithm to produce operating characteristic curves for any method that assigns scores to every class in the hierarchy.
result Top-down classifiers are dominated by a naive flat softmax classifier across the entire operating range.

Bottom-up algorithms outperform top-down in hierarchical community detection at intermediate levels.

problem Finding the optimal hierarchical community structure in networks.
method A bottom-up algorithm for hierarchical clustering of networks.
result Bottom-up algorithms achieve the information-theoretic threshold for exact recovery at intermediate levels of the hierarchy.

Efficient unsupervised training and inference in deep generative models remains a challenging problem. One basic approach, called Helmholtz machine, involves training a top-down directed generative model together with a bottom-up auxiliary model used for approximate inference. Recent results indicate that better genera…

2015-06-12abs ↗pdf ↗

Extends PCVM for multi-class classification with improved accuracy.

problem Lack of probabilistic outputs and contradictory predictions in multi-class classification.
method Proposes mPCVM with two learning algorithms: top-down and bottom-up.
result Superior performance, especially with many classes, validated on synthetic and benchmark data.

We propose a top-down model for cash CLO. This model can consistently price cash CLO tranches both within the same deal and across different deals. Meaningful risk measures for cash CLO tranches can also be defined and computed. This method is self-consistent, easy to implement and computationally efficient. It has the…

2010-04-16abs ↗pdf ↗

Decision tree learning is a popular approach for classification and regression in machine learning and statistics, and Bayesian formulations---which introduce a prior distribution over decision trees, and formulate learning as posterior inference given data---have been shown to produce competitive performance. Unlike c…

2013-03-03abs ↗pdf ↗

A new method to learn EBM in latent space for better data modeling.

problem Efficiently modeling data with complex structures.
method Joint learning of latent space EBM and top-down network using maximum likelihood and MCMC sampling.
result Simple EBM in latent space captures data regularities effectively and performs well in generation and anomaly detection.

End-to-end deep model for coherent probabilistic forecasts in hierarchical time series.

problem Hierarchical probabilistic forecasting for coherent predictions.
method Dirichlet proportions model for learning root and child distributions.
result Significant improvements over state-of-the-art baselines (up to 26%).

Adapting neural networks to guide program optimization for better classifiers.

problem Learning differentiable programs with complex architectures.
method Formulating program optimization as a graph search problem, using neural networks as heuristic relaxations.
result Trained neural networks can guide combinatorial search for programmatic classifiers, improving accuracy and interpretability.

Study improves forecasting of aggregated curves in electricity markets.

problem Improving accuracy in predicting aggregated curves like demand and supply in electricity markets.
method Exploits hierarchical structure of aggregated curves, uses reconciliation methods (bottom-up, top-down, linear optimal, aggregated-down).
result Hierarchical reconciliation methods can significantly improve forecast accuracy of aggregated curves.

A deep generative model is developed for representation and analysis of images, based on a hierarchical convolutional dictionary-learning framework. Stochastic {\em unpooling} is employed to link consecutive layers in the model, yielding top-down image generation. A Bayesian support vector machine is linked to the top-…

2015-12-23abs ↗pdf ↗

As the range of tasks performed by a general vision system expands, executing multiple tasks accurately and efficiently in a single network has become an important and still open problem. Recent computer vision approaches address this problem by branching networks, or by a channel-wise modulation of the network feature…

2020-02-09abs ↗pdf ↗

Study shows perceptual boost of visual attention varies with task difficulty and size.

problem Understanding how task-dependent the perceptual boost of visual attention is in natural settings.
method Designed and trained neural networks on various visual tasks, comparing results to baseline.
result Perceptual boost of attention is stronger with more difficult tasks and weaker with larger task sets.

A new method for feature fusion in U-Net decoders using difference-based gating.

problem Precise fusion of high-level semantics and low-level details in U-Net decoder reconstruction.
method Proposes two difference-based gating approaches: Feature-difference gating (FDG) and Entropy-difference gating (EDG).
result Both FDG and EDG methods outperform existing attention-based fusion methods, with EDG showing superior performance.

Study explores robust Orlicz spaces in finance, showing separability implications.

problem Understanding robustness in financial and economic contexts.
method Distinguished two constructions of robust Orlicz spaces: top-down and bottom-up.
result Separability of robust Orlicz spaces has strong implications for dominatedness and order completeness.

The quality of data representation in deep learning methods is directly related to the prior model imposed on the representations; however, generally used fixed priors are not capable of adjusting to the context in the data. To address this issue, we propose deep predictive coding networks, a hierarchical generative mo…

2013-01-16abs ↗pdf ↗

Hierarchical clustering is a popular unsupervised data analysis method. For many real-world applications, we would like to exploit prior information about the data that imposes constraints on the clustering hierarchy, and is not captured by the set of features available to the algorithm. This gives rise to the problem …

2018-05-24abs ↗pdf ↗

Despite enormous progress in object detection and classification, the problem of incorporating expected contextual relationships among object instances into modern recognition systems remains a key challenge. In this work we propose Information Pursuit, a Bayesian framework for scene parsing that combines prior models …

2017-01-09abs ↗pdf ↗

Deep neural networks have achieved impressive success in large-scale visual object recognition tasks with a predefined set of classes. However, recognizing objects of novel classes unseen during training still remains challenging. The problem of detecting such novel classes has been addressed in the literature, but mos…

2018-04-02abs ↗pdf ↗

A generative model is developed for deep (multi-layered) convolutional dictionary learning. A novel probabilistic pooling operation is integrated into the deep model, yielding efficient bottom-up (pretraining) and top-down (refinement) probabilistic learning. Experimental results demonstrate powerful capabilities of th…

2015-04-15abs ↗pdf ↗

We show that a generative random field model, which we call generative ConvNet, can be derived from the commonly used discriminative ConvNet, by assuming a ConvNet for multi-category classification and assuming one of the categories is a base category generated by a reference distribution. If we further assume that the…

2016-02-10abs ↗pdf ↗

The development of algorithms for hierarchical clustering has been hampered by a shortage of precise objective functions. To help address this situation, we introduce a simple cost function on hierarchies over a set of points, given pairwise similarities between those points. We show that this criterion behaves sensibl…

2015-10-16abs ↗pdf ↗

In this paper, we propose a novel generative model named Stacked Generative Adversarial Networks (SGAN), which is trained to invert the hierarchical representations of a bottom-up discriminative network. Our model consists of a top-down stack of GANs, each learned to generate lower-level representations conditioned on …

2016-12-13abs ↗pdf ↗

We derive a convex optimization problem for the task of segmenting sequential data, which explicitly treats presence of outliers. We describe two algorithms for solving this problem, one exact and one a top-down novel approach, and we derive a consistency results for the case of two segments and no outliers. Robustness…

2014-11-17abs ↗pdf ↗

A new multi-phase approach improves supply chain forecasting accuracy.

problem Improving forecast accuracy for hierarchical supply chain demands.
method Independent child-level forecasting followed by parent-level estimation.
result 82-90% improvement in forecast accuracy compared to traditional methods.

NFM improves deep learning by selectively processing hidden states.

problem Processing entire hidden states in each layer limits modularity and reusability.
method Introduces Neural Function Modules (NFM) with attention, sparsity, and feedback.
result Improves results in classification, generalization, generative modeling, and reinforcement learning.

Study finds almost contact structures in thermal QCD-like theories at intermediate coupling.

problem Understanding (Almost) Contact Structures in thermal QCD-like theories.
method Explicitly obtained (Almost) Contact Structures and SU(3) structures.
result Subspaces of C3S and AC3S are not mutually 'N-path connected' in the Infra-Red.

Several real problems ranging from text classification to computational biology are characterized by hierarchical multi-label classification tasks. Most of the methods presented in literature focused on tree-structured taxonomies, but only few on taxonomies structured according to a Directed Acyclic Graph (DAG). In thi…

2014-06-17abs ↗pdf ↗

Reduces high granularity and dimensionality in hierarchical categorical variables.

problem Overfitting and estimation issues in predictive models due to high granularity and dimensionality.
method Entity embedding and top-down clustering algorithm to reduce granularity and dimensionality.
result The reduced hierarchy improves model fit and complexity balance.

We present a new model for credit index derivatives, in the top-down approach. This model has a dynamic loss intensity process with volatility and jumps and can include counterparty risk. It handles CDS, CDO tranches, Nth-to-default and index swaptions. Using properties of affine models, we derive closed formulas for t…

2009-11-09abs ↗pdf ↗

Extractive compression is a challenging natural language processing problem. This work contributes by formulating neural extractive compression as a parse tree transduction problem, rather than a sequence transduction task. Motivated by this, we introduce a deep neural model for learning structure-to-substructure tree …

2018-09-24abs ↗pdf ↗

New method for summarizing ranking distributions using consensus ranking distributions.

problem Summarizing ranking distributions efficiently and accurately.
method Introducing consensus ranking distributions and a top-down tree-structured statistical algorithm.
result Optimal distortion can be expressed as a function of pairwise probabilities, enabling efficient learning methods.

New VAE models reveal hierarchical visual cortex computations.

problem Capturing hierarchical visual cortex computations in generative models.
method Sparse coding hierarchical VAEs trained on natural images with varied generative and recognition components.
result Representations similar to those in visual cortex emerge under inductive biases.