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.

169,341 papers · 148 categories

Trend · papers per month

2.8%5.7%8.5%11.3% · Apr 201819922001200920182026
48 results for cascaded classifiers

New approach to learning cascaded classifiers for heterogeneous embedded devices.

problem Real-time monitoring and adaptive interventions in mobile health.
method Generalized tree-structured cascades, joint learning of classifiers, novel output combination during training.
result Joint learning of all detectors for tree-structured cascades in resource-constrained environments.

Cascade classifiers are widely used in real-time object detection. Different from conventional classifiers that are designed for a low overall classification error rate, a classifier in each node of the cascade is required to achieve an extremely high detection rate and moderate false positive rate. Although there are …

2013-01-10abs ↗pdf ↗

A method to reduce computation by dynamically sacrificing accuracy in deep neural networks.

problem Balancing computational effort and classification accuracy in deep neural networks.
method A cascade of deep neural networks with dynamically set confidence thresholds based on softmax outputs.
result Reduces 15%-50% in MAC operations with a 1% accuracy degradation.

A real-time adaptive background subtraction framework using a rejection cascade of Gaussians.

problem Real-time background subtraction with pixel-wise modeling trade-offs.
method Decompose Gaussian Mixture Model into an adaptive cascade of Gaussians (CoG).
result 4-5x speed-up and 17% accuracy improvement over baseline.

In this paper we propose an algorithm that builds sparse decision DAGs (directed acyclic graphs) from a list of base classifiers provided by an external learning method such as AdaBoost. The basic idea is to cast the DAG design task as a Markov decision process. Each instance can decide to use or to skip each base clas…

2012-06-27abs ↗pdf ↗

A cascaded autoencoder defends machine learning models from adversarial attacks.

problem Adversarial attacks on machine learning models.
method Denoising and dimensionality reduction using cascaded autoencoders.
result Preprocessed data with cascaded autoencoder pipeline improves model accuracy against adversarial perturbations.

CascadeML trains multi-label models without hyperparameter tuning.

problem Improving multi-label classification performance through hyperparameter optimization.
method CascadeML uses a two-phase incremental learning approach to train multi-label neural networks.
result CascadeML outperforms other multi-label classification algorithms without hyperparameter tuning.

On many social networking web sites such as Facebook and Twitter, resharing or reposting functionality allows users to share others' content with their own friends or followers. As content is reshared from user to user, large cascades of reshares can form. While a growing body of research has focused on analyzing and c…

2014-03-18abs ↗pdf ↗

CASCADE improves uncertainty communication in Parkinson's disease medication management.

problem Uncertainty in clinical decision-making for Parkinson's disease patients.
method CASCADE uses a novel conformal prediction framework to adaptively scale prediction intervals based on classification uncertainty.
result CASCADE produces more efficient and robust prediction intervals for Parkinson's disease patients.

This paper optimizes power grid protection settings to maximize network degradation due to cascading attacks.

problem Cascading attacks on power grids and their undetected nature.
method Constrained Bayesian Optimization applied to transmission line protection settings.
result Even limited misconfiguration of protection settings can cause severe cascading attacks.

New insights into cascade feedback linearization of control systems.

problem Obtaining a cascade feedback linearization for invariant control systems.
method Introducing truncated versions of operators from the calculus of variations to prove new theorems.
result Established new geometry and foundational theorems for future work.

The paper improves theoretical guarantees for Thompson Sampling in cascading bandits.

problem Optimizing online recommender systems with cascading bandits.
method Develops and analyzes new Thompson Sampling algorithms for cascading bandits.
result Establishes the first theoretical guarantees on Thompson Sampling for cascading bandits.

A new approach reduces the size of prediction sets in CP, making it more efficient.

problem Large and costly prediction sets in standard CP.
method Expand correctness criterion to include inferred admissible answers, and use prediction cascades to prune implausible labels.
result Empirically effective in natural language processing and drug discovery.

New research reveals diverse cascade sizes in finite networks, challenging traditional risk assessments.

problem Predicting the size of cascades in finite networks is difficult due to uncertain parameters and missing information.
method Derived explicit closed-form solutions for cascade size distributions in complete and star networks.
result Broad and even bimodal cascade size distributions in finite networks, not centered around the average.

Modeling cascading behavior in complex systems using CTBNs.

problem Understanding which states trigger cascading events in complex systems.
method Continuous-time Bayesian networks (CTBNs) for modeling and identifying likely sentry states.
result Identification of likely sentry states that may lead to cascading behavior.

The study finds that many social media content cascades recur with bursts of popularity over time.

problem Understanding the recurrence of content cascades on social media.
method Large-scale analysis of cascades on Facebook over extended time periods, using a simple model to simulate recurrence.
result Content virality drives recurrence, but beyond a certain popularity, the rate of recurrence decreases.

Study on information cascade fragility under mismatched revealing probabilities.

problem Analyzing the fragility of information cascades in decision-making processes with imperfect knowledge of revealing probabilities.
method Examined sequential decision-making models with players having private information and imitating previous decisions. Studied the effect of a mismatch between players' beliefs and actual revealing probabilities.
result Derived closed-form expressions for optimal learning rates and identified phase transitions in the behavior of asymptotic learning rates.

A search engine usually outputs a list of KK web pages. The user examines this list, from the first web page to the last, and chooses the first attractive page. This model of user behavior is known as the cascade model. In this paper, we propose cascading bandits, a learning variant of the cascade model where the obje…

2015-02-10abs ↗pdf ↗

Structured prediction tasks pose a fundamental trade-off between the need for model complexity to increase predictive power and the limited computational resources for inference in the exponentially-sized output spaces such models require. We formulate and develop the Structured Prediction Cascade architecture: a seque…

2012-08-06abs ↗pdf ↗

Bayesian optimization tackles expensive cascade processes.

problem Optimizing multistage decision-making processes with expensive costs.
method Formulated as Bayesian optimization framework with two types of acquisition functions.
result Demonstrated effectiveness through numerical experiments and a solar cell simulator application.

Model shows financial turbulence similar to turbulence, with wealth cascading from large to small entities.

problem Understanding wealth distribution and dynamics in financial systems.
method Constructed a multiscale model for hierarchical financial structures.
result Found wealth distribution exhibits power law at large scales and Maxwellian at small scales.

Modeling social network activity through user and topic interaction.

problem Understanding complex dynamics of opinion formation in social networks.
method Mixture of Interacting Cascades (MIC) model of marked multidimensional Hawkes processes.
result MIC achieves superior performance in modeling information cascade spread.

The paper addresses the kk-tangle enumeration problem. We introduce a notion of cascade diagram for kk-tangle projections. An effective enumeration algorithm for projections is proposed based on cascade representation. Tangles projections with up to 12 crossings are tabulated. We provide also pictures of alternating …

2007-12-22abs ↗pdf ↗

We consider the problem of finding the graph on which an epidemic cascade spreads, given only the times when each node gets infected. While this is a problem of importance in several contexts -- offline and online social networks, e-commerce, epidemiology, vulnerabilities in infrastructure networks -- there has been ve…

2012-02-08abs ↗pdf ↗

Unified approach for influence maximization using diffusion cascade representations.

problem Influence maximization on networks with diffusion cascades.
method Multi-task neural network learning influencer and susceptible vectors; greedy algorithm for influence maximization.
result IMINFECTOR outperforms other methods in efficiency and seed set quality.

Improves information cascade models using contrastive training and DSTs.

problem Improving models of information cascades using limited labeled data.
method Proposes a contrastive training procedure for models of information cascades as directed spanning trees (DSTs).
result Unsupervised training with additional content features achieves significantly better results, reaching half the accuracy of a fully supervised model.

A model infers dynamic networks from partial observation of cascading processes.

problem Inferring evolving networks from partial observation of node and edge data.
method A novel framework based on a mixture of coupled hierarchical Dirichlet processes.
result Explicit predictive distribution over edges of the underlying network, including future edges.