New method uses neural networks for accurate population genetic inference.
problem Inference for complex, population-scale genetic data.
method Exchangeable neural networks for likelihood-free inference.
result Outperforms state-of-the-art methods on recombination hotspot testing.
Paper proposes active learning for hotspot detection in VLSI design.
problem Hotspot detection in VLSI design is computationally expensive and relies on costly reference libraries.
method Active learning-based layout pattern sampling and hotspot detection flow.
result Significantly reduces lithography simulation overhead with satisfactory detection accuracy.
New method enhances hotspot prediction in IC designs.
problem Design hotspots vary between designs and are hard to predict.
method Synthetic pattern generation based on DOEs.
result Significantly reduces false alarms in hotspot prediction.
Defense against DL-based lithographic hotspot detectors backdooring attacks reduces success rate from 84% to ~0%
problem DL-based lithographic hotspot detectors are vulnerable to backdoor attacks that can misclassify hotspots.
method Training data augmentation to eliminate intentional biases introduced during training.
result Significant reduction in attack success rate (from 84% to ~0%) using the proposed defense.
This work evaluates machine learning-based hotspot detectors on synthesized layout patterns.
problem Evaluating model robustness and generality of machine learning-based hotspot detectors.
method Developed an automatic layout generation tool to synthesize various layout patterns and tested machine learning-based detectors on these synthesized layouts.
result Machine learning-based detectors need continuous study for robustness and generality in DFM flows.
Paper presents a spatio-temporal Bayesian model for early detection of COVID-19 hotspots.
problem Understanding spatio-temporal dynamics of COVID-19 hotspots to prevent outbreaks.
method Spatio-temporal Bayesian framework with a zero-mean Gaussian process and non-stationary kernel function enhanced by deep neural networks.
result Model demonstrates superior hotspot-detection performance compared to baseline methods.
Adversarial perturbations can fool CNN-based lithographic hotspot detectors, but retraining can improve robustness.
problem Adversarial perturbations can mislead ML-based lithographic hotspot detectors.
method Proposed adversarial retraining strategy to improve robustness of CNN-based detectors.
result Adversarial retraining significantly improves robustness of CNN-based hotspot detection against perturbations.
Study compares feature selection methods for stress hotspot classification.
problem Optimizing feature selection for stress hotspot classification in materials.
method Applied various feature selection methods to microstructural data.
result Demonstrated some feature selection techniques are biased, highlighting a preferred method.
Researchers explore non-coherent banding in site-specific recombination.
problem Understanding non-coherent banding in site-specific recombination.
method Survey of recent developments in non-coherent banding on knots.
result Recent advances in non-coherent banding model for site-specific recombination.
Site-specific recombination on supercoiled circular DNA molecules can yield a variety of knots and catenanes. Twist knots are some of the most common conformations of these products and they can act as substrates for further rounds of site-specific recombination. They are also one of the simplest families of knots and …
Divide data into subsets, analyze each, and recombine results for likelihood function computation.
problem Computing likelihood functions for large and complex data.
method Divide & Recombine (D&R) procedure to estimate density parameters of likelihood model (LM) from MCMC draws.
result The method successfully computes likelihood functions for logistic regression data model.
A new evolutionary algorithm improves k-means clustering by recombining the entire population.
problem Optimizing the k-means clustering problem, especially in non-convex cases.
method Recombinator-k-means uses stochastic recombination with a reweighting mechanism.
result Recombinator-k-means outperforms standard genetic algorithms in optimization objective.
A new clustering algorithm tracks satellite hotspot data for bushfire tracking.
problem Tracking bushfires using satellite data.
method Spatiotemporal clustering algorithm with adjustable parameters.
result The algorithm effectively clusters satellite hotspot data for tracking bushfires.
A New Trinomial Recombination Tree Algorithm and Its Applications
Paper develops a high-order recombination algorithm for financial modeling.
problem Creating accurate approximations of stochastic differential equations in finance.
method High-order recombination method applied to practical financial problems.
result Algorithm effectively avoids explosive growth in support cardinality for high-order approximations.
Modeling infection hotspots to quantify effects of contact tracing and testing.
problem Capturing the role of infection hotspots in disease transmission.
method Temporal point process modeling framework to represent visits and disease transmission.
result Estimation of transmission rates at sites and households using Bayesian optimization.
The theme in this paper is the recombining binomial tree to price American put option when the underlying stock follows constant elasticity of variance(CEV) process. Recombining nodes of binomial tree are decided from finite difference scheme to emulate CEV process and the tree has a linear complexity. Also it is deriv…
Survey of robust clustering methods for hotspot detection.
problem Detecting false positives in spatial hotspot mapping.
method Statistically rigorous clustering techniques.
result Survey of models and algorithms for robust clustering.
We develop a topological model of site-specific recombination that applies to substrates which are the connected sum of two torus links of the form T(2,n)#T(2,m). Then we use our model to prove that all knots and links that can be produced by site-specific recombination on such substrates are contained in one of two…
We categorise coherent band (aka nullification) pathways between knots and 2-component links. Additionally, we characterise the minimal coherent band pathways (with intermediates) between any two knots or 2-component links with small crossing number. We demonstrate these band surgeries for knots and links with small cr…
New RL approach builds short ancestral recombination graphs.
problem Building short ancestral recombination graphs (ARGs).
method Reinforcement Learning applied to genetic sequences.
result RL can build ARGs as short as heuristic algorithms.
Paper develops a new method for game options in local volatility models.
problem Optimal stopping in one-dimensional diffusion with general coefficients.
method Skorokhod embedding to construct recombining tree approximations.
result Construct nearly optimal stopping times with convergence rates.
We extend the tangle model, originally developed by Ernst and Sumners, to include composite knots. We show that, for any prime tangle, there are no rational tangle attachments of distance greater than one that first yield a 4-plat and then a connected sum of 4-plats. This is done by building on results on exceptional D…
Market portfolio decomposed into body and tail legs
problem Separation of market portfolio into body and tail legs
method Dynamic value-weighted body and tail legs
result Recombination identity holds for all models
Deep learning improves evolutionary algorithms' adaptability.
problem Improving evolutionary algorithms' adaptability to various circumstances.
method Using deep reinforcement learning to dynamically adjust evolutionary algorithms' strategies.
result Deep learning enhances evolutionary algorithms' fitness increase and attainable fitness.
Study decomposes market portfolio into body and tail legs, revealing systematic differences.
problem Understanding the relationship between body and tail components in market portfolios.
method Decomposes CRSP market portfolio into body and tail legs, analyzes their recombination identity.
result Recombination identity holds for all models but not for all, indicating systematic differences.
Study of Betti numbers in prodsimplicial complexes for directed graphs, focusing on DNA recombination.
problem Analyzing Betti numbers in directed graphs for DNA recombination.
method Custom prodsimplicial complexes for acyclic directed graphs, investigating Betti numbers.
result Investigated Betti numbers and cycles in prodsimplicial complexes for DNA recombination.
Method recombines image content and style from different images.
problem Recombining image content and style from different images.
method Constructs content embedding, uses VAE with leakage filtering to ensure separation of style and content.
result Synthesizes novel images with state-of-the-art performance on few-shot learning tasks.
The protein recombinase can change the knot type of circular DNA. The action of a recombinase converting one knot into another knot is normally mathematically modeled by band surgery. Band surgeries on a 2-bridge knot N((4mn-1)/(2m)) yielding a (2,2k)-torus link are characterized. We apply this and other rational tangl…
A new tree model, GRST, improves option pricing without log-normality assumptions.
problem Limitations of CRR binomial trees in valuing securities with early exercise characteristics.
method Gaussian Recombining Split Tree (GRST) that generates a discrete probability mass function approximating a Gaussian distribution.
result Option prices from GRST align closely with market prices.
A new data-level recombination strategy improves RGB-D salient object detection.
problem RGB-D salient object detection struggles with depth information.
method Proposes a novel data-level recombination strategy to fuse RGB and depth data before feature extraction.
result Achieves a new state-of-the-art performance in RGB-D salient object detection.
Parallelized Bayesian quadrature improves sample efficiency and inference.
problem Efficient Bayesian inference and model evidence calculation.
method Batch Bayesian quadrature with kernel recombination for parallel sampling.
result Empirically, outperforms state-of-the-art methods in various datasets.
Paper presents an efficient approach for integrating LSTM language models in LVCSR systems.
problem Difficulty in incorporating LSTM language models efficiently into LVCSR systems.
method First-pass decoding with LSTM-LM followed by lattice rescoring and hypothesis recombination.
result Competitive results on Hub5'00 and Librispeech corpora with runtime better than real-time.
Improved kernel quadrature with convex weights using subsampling.
problem Constructing quadrature rules with small worst-case error.
method Combining spectral properties of the kernel with recombination results.
result Effective algorithms for constructing convex quadrature rules with i.i.d. samples.
Neural network ensembles predict design rule violations from early stages of IC design.
problem Predicting design rule violations from placement and global routing stages in IC design.
method Proposes a framework using neural network ensembles with soft voting and PCA-based subset selection.
result Significant improvement in model performance compared to baseline, including better performance than random forest.
We give a short topological proof for Rubermans Theorem about mutation and volume, using the Maskit combination theorem and the homology of the linear group.
A general method to construct recombinant tree approximations for stochastic volatility models is developed and applied to the Heston model for stock price dynamics. In this application, the resulting approximation is a four tuple Markov process. The first two components are related to the stock and volatility processe…
Model predicts drug overdose hotspots using EMS and toxicology data.
problem Predicting drug overdose hotspots to focus limited services.
method Spatial-temporal point process model integrating EMS and toxicology data.
result Model improves prediction accuracy by integrating heterogeneous data.
Model predicts unseen climate extremes to inform risk planning.
problem Missing unseen climate extremes in historical records.
method DeepX-GAN model capturing spatial dependence.
result Unseen heat extremes disproportionately threaten vulnerable regions.
We develop a model characterizing all possible knots and links arising from recombination starting with a twist knot substrate, extending previous work of Buck and Flapan. We show that all knot or link products fall into three well-understood families of knots and links, and prove that given a positive integer n, the…
SCAN learns hierarchical visual concepts from unsupervised data.
problem Discovering coherent rules in natural world visual diversity.
method SCAN learns concepts through fast symbol association and disentangled visual primitives.
result SCAN generates diverse images from symbolic descriptions and manipulates visual concepts hierarchically.
We develop a topological model of knots and links arising from a single (or multiple processive) round(s) of recombination starting with an unknot, unlink, or (2,m)-torus knot or link substrate. We show that all knotted or linked products fall into a single family, and prove that the size of this family grows linearly …
In plant and animal breeding studies a distinction is made between the genetic value (additive + epistatic genetic effects) and the breeding value (additive genetic effects) of an individual since it is expected that some of the epistatic genetic effects will be lost due to recombination. In this paper, we argue that t…
MCP learns reusable skills for complex tasks by combining simple ones.
problem Learning complex tasks with many skills requires impractical amounts of data.
method Factorizes skills into primitives that can be combined multiplicatively.
result MCP can learn and reuse skills for novel tasks from pre-training.
This paper gives new and elementary combinatorial topological proofs of the classification of unoriented and oriented rational knots and links. These proofs are based on the known classification of alternating knots through flyping, and the calculus of continued fractions. We characterize the class of strongly invertib…
New training method for ReLU networks achieves optimal weight size for memorization.
problem Approximate memorization of arbitrary real labels with neural networks.
method Complex recombination training procedure for ReLU networks.
result Approximate memorization with nearly optimal weight size and neuron count.
SwISS improves scalability of Bayesian inference for large datasets.
problem Scalability issues in Bayesian inference for large datasets.
method Divide-and-conquer approach with SwISS for recombining sub-posterior samples.
result SwISS accurately approximates the original posterior distribution.
New model separates objects in scenes, enabling novel arrangements and depth.
problem Lack of modular, compositional scene modeling in generative models.
method Ensemble of generative models (experts) compete for explaining different parts of a scene.
result Model generates scenes with novel object arrangement and depth ordering.