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

Trend · papers per month

98195293390 · Jun 202019922001200920172026
48 results for child development

Local semi-supervised method improves brain tissue classification in child MRI.

problem Inaccurate detection of brain tissue classes due to intensity variations in early developing brains.
method Kernel Fisher Discriminant Analysis (KFDA) combined with SSIM for perceptual image quality assessment.
result Optimal brain partitioning into subdomains with different average intensity values and separating surfaces between brain parts.

The study examines Hawkes processes and their long-term behavior.

problem Understanding the long-term behavior of Hawkes processes.
method Proving functional limit theorems under various conditions on the dispersion of child events.
result Functional limit theorems hold for Hawkes processes with different levels of child event dispersion.

New method for causal discovery using peeling algorithms for various data types.

problem Challenges in causal discovery due to unmeasured confounders.
method Two peeling algorithms (bottom-up and top-down) for causal discovery with generalized structural equation models.
result Valid discovery of causal relationships and parent-child effects in diverse data types.

With the success of deep neural networks, Neural Architecture Search (NAS) as a way of automatic model design has attracted wide attention. As training every child model from scratch is very time-consuming, recent works leverage weight-sharing to speed up the model evaluation procedure. These approaches greatly reduce …

2020-01-06abs ↗pdf ↗

Previous work in hierarchical reinforcement learning has faced a dilemma: either ignore the values of different possible exit states from a subroutine, thereby risking suboptimal behavior, or represent those values explicitly thereby incurring a possibly large representation cost because exit values refer to nonlocal a…

2012-06-27abs ↗pdf ↗

Enhances early risk assessments for pediatric outcomes using contrastive learning.

problem Improving risk assessments in early stages of pediatric development.
method Contrastive multi-modal framework that treats each time window as a distinct modality, training on all available data.
result Consistent improvements in early-stage risk assessments validated on real-world tasks.

Study maps interdependence of SDGs, finds complex, dynamic linkages.

problem Identify which SDGs promote progress and how quickly.
method Used a balanced panel of 114 countries from 2000 to 2024, applying two estimators to recover directed interaction network and measure dynamic linkages.
result 84 goal linkages survive false-discovery control, showing both synergies and trade-offs, with no single goal acting as a universal accelerator.

We formalize the notion of a pseudo-ensemble, a (possibly infinite) collection of child models spawned from a parent model by perturbing it according to some noise process. E.g., dropout (Hinton et. al, 2012) in a deep neural network trains a pseudo-ensemble of child subnetworks generated by randomly masking nodes in t…

2014-12-16abs ↗pdf ↗

Generates infinite-depth hierarchical clusters from few examples.

problem Inadequate finite-sample clustering methods for fine-scale hierarchical structures.
method Classification fields generated by a local refinement rule, approximated by predictors.
result Learned predictors can approximate infinite-depth hierarchical structures.

We introduce a new routing algorithm for capsule networks, in which a child capsule is routed to a parent based only on agreement between the parent's state and the child's vote. The new mechanism 1) designs routing via inverted dot-product attention; 2) imposes Layer Normalization as normalization; and 3) replaces seq…

2020-02-12abs ↗pdf ↗

Recurrent neural networks (RNNs), particularly long short-term memory (LSTM), have gained much attention in automatic speech recognition (ASR). Although some successful stories have been reported, training RNNs remains highly challenging, especially with limited training data. Recent research found that a well-trained …

2015-05-18abs ↗pdf ↗

Robots learn actions and language through curiosity-driven self-exploration.

problem Efficient development of actions and language in infants and robots.
method Curiosity-driven self-exploration using Q-learning to amortize active inference.
result Curiosity-driven exploration enables faster learning and compositional generalization.

Efficiently learns linear non-Gaussian DAGs with noisy nodes.

problem Learning DAGs with non-Gaussian noise and diverging number of nodes.
method Proposes a novel method using topological layers for bottom-up reconstruction and consistent parent-child relations.
result Topological layers can be exactly reconstructed and parent-child relations established without faithfulness assumption.

We propose a novel method designed for large-scale regression problems, namely the two-stage best-scored random forest (TBRF). "Best-scored" means to select one regression tree with the best empirical performance out of a certain number of purely random regression tree candidates, and "two-stage" means to divide the or…

2019-05-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 ↗

Bayesian method for causal discovery from unknown general interventions.

problem Learning causal DAGs from unknown interventions that modify parent sets.
method Bayesian approach with MCMC for approximating posterior DAGs and intervention targets.
result Bayesian method can identify DAGs and intervention targets up to equivalence classes.

A new algorithm improves sample complexity for thresholding in Monte Carlo Tree Search.

problem Determining if the root node value of a tree is at least a given threshold.
method Developed a δ-correct sequential sampling algorithm based on the Track-and-Stop strategy.
result Ratio-based modification of D-Tracking strategy reduces sample complexity and computational cost.

Posterior regularization enhances Bayesian hierarchical mixture clustering by improving node separation.

problem High nodal variance in BHMC trees, leading to weak separation between nodes at higher levels.
method Employing Posterior Regularization to impose max-margin constraints on nodes at every level.
result Improves cluster separation in BHMC models, enhancing overall model performance.

Novel approach for creating interpretable classifiers using bilevel optimization of split-rules in NLDTs.

problem Creating highly accurate and easily interpretable classifiers for practical applications.
method Representing classifiers as assemblies of simple mathematical rules using NLDTs with evolutionary bilevel optimization.
result The approach ensures interpretability while achieving high accuracy on various classification problems.

A Bayesian treatment of latent directed graph structure for non-iid data is provided where each child datum is sampled with a directed conditional dependence on a single unknown parent datum. The latent graph structure is assumed to lie in the family of directed out-tree graphs which leads to efficient Bayesian inferen…

2012-06-13abs ↗pdf ↗

Model predicts trading strategies based on latent demand and price impact.

problem Predicting strategic trading behavior of investors with private targets.
method Equilibrium model of dynamic trading, learning, and pricing by strategic investors.
result Trading strategies are a combination of target following, liquidity provision, and front-running based on latent demand and price pressure.

Measures price impact in order-driven markets without relying on averages.

problem Measuring price impact in order-driven markets without relying on averages.
method Modeling the limit order book using state-dependent Hawkes processes and defining price impact profile as a function of the compensator of a stochastic process.
result The clustering of sell child orders has a bigger impact on price than their sizes.

Due to myriads of classes, designing accurate and efficient classifiers becomes very challenging for multi-class classification. Recent research has shown that class structure learning can greatly facilitate multi-class learning. In this paper, we propose a novel method to learn the class structure for multi-class clas…

2012-02-14abs ↗pdf ↗

This paper proposes a novel type of random forests called a denoising random forests that are robust against noises contained in test samples. Such noise-corrupted samples cause serious damage to the estimation performances of random forests, since unexpected child nodes are often selected and the leaf nodes that the i…

2017-10-30abs ↗pdf ↗

In this paper, we introduce an alternative approach, namely GEN (Genetic Evolution Network) Model, to the deep learning models. Instead of building one single deep model, GEN adopts a genetic-evolutionary learning strategy to build a group of unit models generations by generations. Significantly different from the well…

2018-05-19abs ↗pdf ↗

Increasingly complex generative models are being used across disciplines as they allow for realistic characterization of data, but a common difficulty with them is the prohibitively large computational cost to evaluate the likelihood function and thus to perform likelihood-based statistical inference. A likelihood-free…

2014-07-18abs ↗pdf ↗

A clinician desires to use a risk-stratification method that achieves confident risk-stratification - the risk estimates of the different patients reflect the true risks with a high probability. This allows him/her to use these risks to make accurate predictions about prognosis and decisions about screening, treatments…

2018-11-02abs ↗pdf ↗

New approach tackles non-Markovian behavior in maternal health programs.

problem Improving adherence and engagement in maternal and child healthcare programs.
method Extending RMABs to non-Markovian settings, using time-series forecasting and TARI policy.
result Significant increase in engagement and content listened compared to existing methods.

One out of four children in India are leaving grade eight without basic reading skills. Measuring the reading levels in a vast country like India poses significant hurdles. Recent advances in machine learning opens up the possibility of automating this task. However, the datasets of children's speech are not only rare …

2019-11-27abs ↗pdf ↗

New method clusters infant vocalizations using topological data.

problem Clustering infant vocalizations for developmental analysis.
method Topologically augmented signal representation with Dirichlet process mixture model.
result 8 clusters of vocalizations identified in the first 12 months of life.

Two new Hie-TAN and Hie-TAN-Lite algorithms improve TAN for hierarchical feature spaces.

problem Learning dependencies in hierarchical feature spaces.
method Exploits hierarchical parent-child relationships as constraints to learn a dependency tree.
result Hie-TAN-Lite outperforms Hie-TAN and other methods in predictive accuracy.

We propose dynamical systems trees (DSTs) as a flexible class of models for describing multiple processes that interact via a hierarchy of aggregating parent chains. DSTs extend Kalman filters, hidden Markov models and nonlinear dynamical systems to an interactive group scenario. Various individual processes interact a…

2012-07-11abs ↗pdf ↗