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

Trend · papers per month

57115172229 · May 202619922001200920172026
48 results for top-down control

A new network controls task execution in a single vision system.

problem Executing multiple tasks accurately and efficiently in a single network.
method A top-down control network modifies main recognition network activations based on selected task, image content, and spatial location.
result Significantly better results on four datasets compared to state-of-the-art approaches.

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 ↗

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%).

The problem of continuous inverse optimal control (over finite time horizon) is to learn the unknown cost function over the sequence of continuous control variables from expert demonstrations. In this article, we study this fundamental problem in the framework of energy-based model, where the observed expert trajectori…

2019-04-10abs ↗pdf ↗

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.

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.

We propose a linear-time, single-pass, top-down algorithm for multiple testing on directed acyclic graphs (DAGs), where nodes represent hypotheses and edges specify a partial ordering in which hypotheses must be tested. The procedure is guaranteed to reject a sub-DAG with bounded false discovery rate (FDR) while satisf…

2017-09-29abs ↗pdf ↗

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.

Hierarchical AI multi-agent framework optimizes equity portfolios in China's A-share market.

problem Optimizing equity portfolios in China's A-share market using AI and multi-agent systems.
method A hierarchical multi-agent design integrating macro, firm-level, and reinforcement learning approaches.
result Consistently outperforms benchmarks and state-of-the-art systems on risk-adjusted returns and drawdown control.

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 ↗

In this work, we propose a novel recurrent neural network (RNN) architecture. The proposed RNN, gated-feedback RNN (GF-RNN), extends the existing approach of stacking multiple recurrent layers by allowing and controlling signals flowing from upper recurrent layers to lower layers using a global gating unit for each pai…

2015-02-09abs ↗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 ↗

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.

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.

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.

A new method for generating replay samples on the fly, optimizing for not forgetting.

problem Addressing the issue of forgetting in neural networks.
method Generates auxiliary samples on the fly using the model's implicit memory, specialized to each real training batch.
result Optimizing for not forgetting leads to more efficient and scalable generation of specialized samples.

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 ↗

A recent Cell paper [Chang and Tsao, 2017] reports an interesting discovery. For the face stimuli generated by a pre-trained active appearance model (AAM), the responses of neurons in the areas of the primate brain that are responsible for face recognition exhibit strong linear relationship with the shape variables and…

2018-05-14abs ↗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.