Computational identification of promoters is notoriously difficult as human genes often have unique promoter sequences that provide regulation of transcription and interaction with transcription initiation complex. While there are many attempts to develop computational promoter identification methods, we have no reliab…
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
48 results for “Promoter identification”
iPromoter-BnCNN identifies and classifies six types of sigma promoters.
problem Accurate classification of sigma promoters remains challenging.
method Convolutional Neural Network (CNN) combining local features.
result Supremacy on 5-fold cross-validation and independent test datasets.
A new filter design improves system identification accuracy.
problem Improving system identification accuracy for various system types.
method Generalized proportionate-type normalized subband adaptive filter (GPtNSAF) using least squares on subband errors with a sparsity penalty.
result GPtNSAF benefits from increasing subbands more than sparsity for quasi-sparse or dispersive systems, and both aspects are complementary for sparse systems.
We establish a connection between trend filtering and system identification which results in a family of new identification methods for linear, time-varying (LTV) dynamical models based on convex optimization. We demonstrate how the design of the cost function promotes a model with either a continuous change in dynamic…
Paper addresses LSTM stability for thermal systems using infinity-norm.
problem Stability of LSTM networks in thermal systems.
method Derived ISS condition for LSTM, developed training strategy.
result ISS-promoted LSTM outperforms other models in thermal system case study.
RMDA trains structured neural networks with regularization and variance reduction.
problem Training structured neural networks with desired properties.
method RMDA algorithm for structured NNs with regularization and variance reduction.
result RMDA achieves desired structures identical to regularizer's at stationary points.
This paper begins with considering the identification of sparse linear time-invariant networks described by multivariable ARX models. Such models possess relatively simple structure thus used as a benchmark to promote further research. With identifiability of the network guaranteed, this paper presents an identificatio…
Regularized least-squares approaches have been successfully applied to linear system identification. Recent approaches use quadratic penalty terms on the unknown impulse response defined by stable spline kernels, which control model space complexity by leveraging regularity and bounded-input bounded-output stability. T…
In this paper, we study the system identification problem for sparse linear time-invariant systems. We propose a sparsity promoting block-regularized estimator to identify the dynamics of the system with only a limited number of input-state data samples. We characterize the properties of this estimator under high-dimen…
Bayesian framework for robust model discovery from noisy data.
problem Robust model discovery from noisy, sparse and irregular observations of nonlinear systems.
method Bayesian differential programming using Hamiltonian Monte Carlo and sparsity-promoting priors.
result Efficient inference of posterior distributions over plausible models with quantified uncertainty.
EAP clusters evolving data, promoting temporal smoothness and automatic cluster tracking.
problem Clustering time-evolving data with temporal smoothness and automatic cluster identification.
method Evolutionary Affinity Propagation (EAP) on a factor graph exchanging messages between adjacent data snapshots.
result EAP clusters data with temporal smoothness and automatically tracks clusters, outperforming existing methods.
GP-NODE combines Gaussian processes and NeuralODEs for Bayesian system identification.
problem Bayesian systems identification from partial, noisy and irregular observations.
method Differentiable programming, Hamiltonian Monte Carlo, Gaussian Process priors, sparsity-promoting priors.
result Efficient inference of posterior distributions over plausible models with quantified uncertainty.
Framework identifies causal direction from single data setting.
problem Identify causal direction from single observational data.
method VCEI framework based on ICM principle and artificial variation.
result VCEI is competitive to other frameworks in identifying causal direction.
Sparse Identification of Nonlinear Dynamical Systems via Reweighted -regularized Least Squaresstat.ML
Method improves SINDy for noisy nonlinear systems.
problem Recover nonlinear dynamical systems from noisy data.
method Reweighted -regularized least squares.
result Improved accuracy and robustness in noisy conditions.
fMRI is a unique non-invasive approach for understanding the functional organization of the human brain, and task-based fMRI promotes identification of functionally relevant brain regions associated with a given task. Here, we use fMRI (using the Poffenberger Paradigm) data collected in mono- and dizygotic twin pairs t…
Gradient boosting predicts promotion efficiency using multiple performance indicators.
problem Forecasting promotion efficiency in FMCG retail.
method Gradient boosting applied to six performance indicators for different product groups.
result Models accurately forecast promotion efficiency, optimizing marketing strategies.
The paper introduces a frequency-domain estimator for low-order systems from noisy data.
problem Estimating frequency responses of low-order systems from noisy measurements.
method Uses a quadratic data-fitting term regularized by the nuclear norm of a Loewner matrix, subject to a convex stability constraint.
result Proves a finite-sample error bound and extends it to all frequencies through rational interpolation.
This paper improves system identification by reducing sample complexity for high-dimensional linear dynamical systems.
problem High sample complexity for learning partially observed linear dynamical systems in high dimensions.
method Introduces an -regularized estimation method that reduces sample complexity from linear to logarithmic with system dimension.
result Markov parameters can be learned with logarithmic number of samples relative to system dimension, improving sample complexity.
Domain adaptation in person re-identification (re-ID) has always been a challenging task. In this work, we explore how to harness the natural similar characteristics existing in the samples from the target domain for learning to conduct person re-ID in an unsupervised manner. Concretely, we propose a Self-similarity Gr…
The potential of recovering the topology of a grid using solely publicly available market data is explored here. In contemporary whole-sale electricity markets, real-time prices are typically determined by solving the network-constrained economic dispatch problem. Under a linear DC model, locational marginal prices (LM…
We develop a model to predict effects of sequential interventions, clarifying their combined impact.
problem Uncertainty in generalizing behavioral predictions for combinations of interventions.
method Explicit model for composition of interventions, identifying their combined effect.
result Our compositional model aids prediction in sparse data conditions.
Dynamic promotion optimization for e-commerce platforms within financial constraints.
problem Balancing promotional costs with incremental revenue for sustainable growth.
method Knapsack Problem formulation for dynamic optimization, Retrospective Estimation, online-dynamic calibration.
result Significant increase in target outcome while staying within financial constraints.
Paper introduces variational inference for Bayesian inverse problems with gamma hyperpriors.
problem Bayesian inverse problems with sparse solutions.
method Variational iterative alternating scheme for hierarchical models with gamma hyperpriors.
result Accurate reconstruction and meaningful uncertainty quantification.
Understanding and predicting the popularity of online items is an important open problem in social media analysis. Considerable progress has been made recently in data-driven predictions, and in linking popularity to external promotions. However, the existing methods typically focus on a single source of external influ…
Paper develops a method to learn optimal sparsity-promoting regularizers for linear inverse problems.
problem Solving linear inverse problems with sparse solutions.
method Bilevel optimization framework to select an optimal synthesis operator .
result Established well-posedness and theoretical guarantees for the learning process.
Large-scale recurrent networks have drawn increasing attention recently because of their capabilities in modeling a large variety of real-world phenomena and physical mechanisms. This paper studies how to identify all authentic connections and estimate system parameters of a recurrent network, given a sequence of node …
A variation of the Minority Game has been applied to study the timing of promotional actions at retailers in the fast moving consumer goods market. The underlying hypotheses for this work are that price promotions are more effective when fewer than average competitors do a promotion, and that a promotion strategy can b…
Inverse problems and regularization theory is a central theme in contemporary signal processing, where the goal is to reconstruct an unknown signal from partial indirect, and possibly noisy, measurements of it. A now standard method for recovering the unknown signal is to solve a convex optimization problem that enforc…
Physics-constrained deep learning predicts geophysical dynamics with boundedness.
problem Forecasting geophysical systems with hidden variables and incomplete observations.
method Physics-constrained neural ordinary differential equation (NODE) representations with boundedness constraints.
result The approach generalizes learned dynamics to arbitrary initial conditions.
Twitter promotes cryptocurrency pump-and-dumps, affecting trading behavior and returns.
problem The influence of Twitter on cryptocurrency pump-and-dump events.
method Analysis of abnormal returns, trading volume, and tweet activity.
result Investors relying on Twitter information sell later, leading to significant losses.
Net-Promoter Score (NPS) is now ubiquitous as an easily-collected market research metric, having displaced many serious market research processes. Unfortunately, this has been its sole success. It possesses few, if any, of the characteristics that might be regarded as highly desirable in a high-level market research me…
SPADE improves demand forecasting accuracy by 4.5% for post-promotion periods.
problem Overreacting to peak events in demand forecasting leads to biased forecasts.
method SPADE splits forecasting into two tasks: one for peak events and another for post-peak events, using masked convolution filters and a specialized Peak Attention module.
result Overall PPE improvement of 4.5%, 30% improvement for most affected forecasts after promotions and holidays, and 3.9% improvement in PE accuracy.
SafeAccess is an integrated system designed to provide easier and safer access to a smart home for people with or without disabilities. The system is designed to enhance safety and promote the independence of people with disability (i.e., visually impaired). The key functionality of the system includes the detection an…
Convex optimization with sparsity-promoting convex regularization is a standard approach for estimating sparse signals in noise. In order to promote sparsity more strongly than convex regularization, it is also standard practice to employ non-convex optimization. In this paper, we take a third approach. We utilize a no…
Structural equation models (SEMs) have been widely adopted for inference of causal interactions in complex networks. Recent examples include unveiling topologies of hidden causal networks over which processes such as spreading diseases, or rumors propagate. The appeal of SEMs in these settings stems from their simplici…
Gaussian Mixture Model with unknown diagonal covariances via continuous sparse regularizationmath.ST
Paper estimates GMMs with unknown covariances using sparse regularization.
problem Estimating GMMs with unknown diagonal covariances from samples.
method Employed Beurling-LASSO (BLASSO) for sparse estimation of component means, covariances, and weights.
result Established non-asymptotic recovery guarantees with nearly parametric convergence rates.
Framework models multiscale dynamics with Bayesian learning for regime changes.
problem Analyzing complex interactions between fast and slow processes.
method Hierarchical state-space modeling with Sequential Monte Carlo.
result Bayesian approach accurately tracks state transitions and identifies switching dynamics.
Win-score promotion gates in aggregator-routed RFQ markets: A two-tier stochastic control modelq-fin.RM
Model analyzes RFQ markets using stochastic control to optimize dealer performance and inventory.
problem Optimizing market making in aggregator-routed RFQ markets with varying dealer performance scores.
method Two-tier stochastic control model that separates RFQ-level price competition from macro routing.
result Optimal controls can be expressed through derivatives of reduced Hamiltonians, leading to interpretable mappings from optimal win probabilities to optimal offsets.
Distance metric learning (DML), which learns a distance metric from labeled "similar" and "dissimilar" data pairs, is widely utilized. Recently, several works investigate orthogonality-promoting regularization (OPR), which encourages the projection vectors in DML to be close to being orthogonal, to achieve three effect…
IAGAN method improves medical image reconstruction by incorporating adaptive GAN priors.
problem Reconstructing high-fidelity medical images from incomplete data.
method Image-adaptive GAN-based reconstruction method (IAGAN).
result IAGAN can recover fine structures relevant for medical diagnosis.
Paper explores using EEG for better speaker identification, even in noisy environments.
problem Speaker identification performance degrades in background noise.
method Uses EEG signals to enhance speaker identification systems, comparing with acoustic features.
result Speaker identification system using only EEG features outperforms one using only acoustic features in high background noise.
Statistical de Rham Hodge operators, spectral Einstein functionals and the noncommutative residuemath.DG
Promotes spectral functionals to noncommutative fields and proves a theorem.
problem Spectral functionals on noncommutative fields and manifolds with boundary.
method Carries out promotion to spectral functionals, associates with noncommutative residue, and proves theorem.
result Proves Dabrowski-Sitarz-Zalecki type theorem for statistical de Rham Hodge operators on manifolds with boundary.
Study finds inventory inaccuracies are linked to store activity and product perishability.
problem Inventory record inaccuracy in grocery retailing environments.
method Analysis of 24,000 SKUs across 11 stores, field quasi-experiment on audits.
result Inventory audits can boost sales by 11%, especially for perishable items.
This work investigates fundamental questions related to learning features in convolutional neural networks (CNN). Empirical findings across multiple architectures such as VGG, ResNet, Inception, DenseNet and MobileNet indicate that weights near the center of a filter are larger than weights on the outside. Current regu…
Parsimonious Dynamic Mode Decomposition selects sparse modes robustly.
problem Manual tuning of sparsity parameters in traditional DMD.
method Time-delay embedding and Orthogonal Matching Pursuit.
result Autonomously determines optimally sparse subset of modes.
Recently, a number of mostly -norm regularized least squares type deterministic algorithms have been proposed to address the problem of \emph{sparse} adaptive signal estimation and system identification. From a Bayesian perspective, this task is equivalent to maximum a posteriori probability estimation under a …
We propose a method for building an interpretable recommender system for personalizing online content and promotions. Historical data available for the system consists of customer features, provided content (promotions), and user responses. Unlike in a standard multi-class classification setting, misclassification cost…
In the present paper we study interval identification systems of order three. We prove that the Rauzy induction preserves symmetry: for any symmetric interval identification system of order three after finitely many iterations of the Rauzy induction we always obtain a symmetric system. We also provide an example of sym…