Improves writer identification with unlabeled data and weighted label smoothing.
problem Offline writer identification requires labeled data, which is costly and time-consuming.
method Proposed a semi-supervised feature learning pipeline with weighted label smoothing regularization.
result Significantly improved baseline performance on writer identification datasets.
Owing to the rapid growth of touchscreen mobile terminals and pen-based interfaces, handwriting-based writer identification systems are attracting increasing attention for personal authentication, digital forensics, and other applications. However, most studies on writer identification have not been satisfying because …
Improves signature verification accuracy using deep CNN features.
problem Handwritten signature verification accuracy.
method Deep CNN features combined with writer-independent SVM classifier.
result Proposed approach outperforms other WI-HSV methods.
Paper proposes an ensemble model for writer-independent offline signature verification using deep learning.
problem Difficulty in distinguishing genuine signatures from skilled forgeries in writer-independent offline signature verification.
method Used an ensemble model with two CNNs for feature extraction, RGBT for classification, and stacking for final prediction.
result Achieved state-of-the-art performance on various datasets.
Study improves offline signature verification by combining multiple loss functions in CNNs.
problem Challenges in offline signature verification, especially forgeries.
method Examined and integrated cross entropy, Cauchy-Schwarz divergence, and hinge loss into a dynamic multi-loss function.
result Substantial improvements in EERs for writer-dependent OSV protocols.
Automatic Offline Handwritten Signature Verification has been researched over the last few decades from several perspectives, using insights from graphology, computer vision, signal processing, among others. In spite of the advancements on the field, building classifiers that can separate between genuine signatures and…
This paper illustrates the themes of the title in terms of: van Kampen type theorems for the fundamental groupoid; holonomy and monodromy groupoids; and higher homotopy groupoids. Interaction with work of the writer is explored.
Game contingent claims (GCCs) generalize American contingent claims by allowing the writer to recall the option as long as it is not exercised, at the price of paying some penalty. In incomplete markets, an appealing approach is to analyze GCCs like their European and American counterparts by solving option holder's an…
Paper uses AI to predict stock market volatility with neural networks and genetic algorithms.
problem Traditional methods for predicting stock market volatility have high errors.
method Back-propagation neural network and genetic algorithm integrated model.
result The model predicts future volatility with low errors and high accuracy.
Paper proposes equal risk pricing for financial derivatives using convex risk measures.
problem Equal risk pricing and hedging in financial derivatives with convex risk measures.
method Established that the problem reduces to solving independently hedging problems for writer and buyer with zero initial capital. Provided dynamic programming equations for European and American options under Markovian decompositions of convex risk measures.
result Equal risk pricing leads to more similar and smaller risks for both writer and buyer compared to other pricing methods.
Deep transfer learning from Persian handwriting improves offline signature verification.
problem Challenges in offline signature verification, especially with skilled forgeries and limited training data.
method Transfer learning approach from Persian handwriting to multi-language OSV, using Residual CNNs for feature learning and SVMs for verification.
result Significant improvement in Equal Error Rate (EER) on UT-Sig dataset (9.80% EER), surpassing state-of-the-art methods.
We study the problem of option pricing and hedging strategies within the frame-work of risk-return arguments. An economic agent is described by a utility function that depends on profit (an expected value) and risk (a variance). In the ideal case without transaction costs the optimal strategy for any given agent is fou…
Deep learning improves gender classification from handwriting.
problem Classifying gender from handwritten text.
method Convolutional Neural Network (CNN) for feature extraction and gender classification.
result Deep learning approach outperforms human examiners in gender classification accuracy.
Machine learning predicts TV show success based on factors like characters and direction.
problem Predicting the success of TV shows in a competitive market.
method Descriptive and predictive modeling using machine learning.
result Shows with strong characters and good direction tend to be more successful.
Improved BERT model with latent persona and topic variables.
problem Improving BERT's domain-specific utility while maintaining generalization.
method Combining BERT with Universal Transformer, adding latent persona and topic variables.
result Pre-trained model for social texts outperforms baseline.
Deep learning improves handwriting style transfer and extraction.
problem Improving handwriting style transfer and extraction using deep neural networks.
method Used a deep conditioned autoencoder on IRON-OFF handwriting data-set to explore style transfer and extraction.
result Improved metrics of state-of-the-art methods by a large margin in style transfer and extraction experiments.
This paper examines the valuation of a generalized American-style option known as a Game-style call option in an infinite time horizon setting. The specifications of this contract allow the writer to terminate the call option at any point in time for a fixed penalty amount paid directly to the holder. Valuation of a pe…
We present an approach for pricing European call options in presence of proportional transaction costs, when the stock price follows a general exponential Lévy process. The model is a generalization of the celebrated work of Davis, Panas and Zariphopoulou (1993), where the value of the option is defined as the utility …
We investigate the integration of a planning mechanism into sequence-to-sequence models using attention. We develop a model which can plan ahead in the future when it computes its alignments between input and output sequences, constructing a matrix of proposed future alignments and a commitment vector that governs whet…
The study examines pricing American options with both exogenous and endogenous transaction costs.
problem Pricing American options with transaction costs and liquidity risks.
method Modeling liquidity risks as a mean-reverting process and transaction costs as proportional to trading amount. Two nonlinear PDEs are used to characterize option values. Numerical solution via ADI method and model calibration using maximum likelihood estimation.
result The model incorporating liquidity risks significantly outperforms the Leland model.
The writers propose a mathematical Method for deriving risk weights which describe how a borrower's income, relative to their debt service obligations (serviceability) affects the probability of default of the loan. The Method considers the borrower's income not simply as a known quantity at the time the loan is made, …
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.
Reconstructs lost MNIST dataset to validate previous findings.
problem Lost precise derivation steps of MNIST dataset.
method Trace each MNIST digit to NIST source, reconstruct complete test set.
result Reconstructed MNIST dataset confirms previous findings on classifier performance.
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…
New bounds on machine learning data leakage identified.
problem Machine Learning models can leak sensitive information.
method Formalized attack setups, derived universal bounds, studied mutual information.
result Connected attack success rate to generalization gap and mutual information.
Improved driver identification accuracy using steering wheel data.
problem Accurately identifying drivers based on naturalistic driving behavior.
method Novel approach for window length parameter design, leveraging GRUs neural network.
result Increased driver identification accuracy from under 15% to over 65%.
Simplified identification methods for causal inference with arbitrary interventional distributions.
problem Estimating cause-effect relationships from data with experimental interventions.
method Using Single World Intervention Graphs and nested model factorization, we provide algorithms for identifying causal parameters from mixed observational and interventional distributions.
result Our algorithms are complete for certain types of interventional marginal distributions.
Cyclic coordinate descent identifies models in finite time and converges linearly.
problem Model identification in composite nonsmooth optimization problems.
method Cyclic coordinate descent for a wide class of functions.
result Explicit local linear convergence rates for coordinate descent.
WiPIN uses Wi-Fi signals to identify people without requiring them to walk.
problem Identification requires walking and is unreliable with many users.
method Extracts body information from Wi-Fi signals without user movement.
result Achieves 92% accuracy with 30 users, robust to various settings.
Study on identifying and inferring nonlinear dynamics on unknown networks.
problem Identifying network structure in nonlinear dynamic systems with unknown interactions.
method Showed network structure is not generically identified, requiring sufficient spectral heterogeneity. Developed necessary and sufficient conditions for identification and proposed a semiparametric estimator.
result Necessary and sufficient conditions for identification of network structure in nonlinear dynamic systems.
New findings on complexity limits in fixed budget bandit identification.
problem Determining the best possible error rate for fixed budget bandit identification.
method Analyzing the best non-adaptive sampling procedures and showing the existence of complexities.
result No fixed complexity for certain bandit identification tasks.
Deep learning's convolutional networks improve system identification.
problem Nonlinear system identification problems.
method Exploration of relationships between TCN and Volterra series/block-oriented models.
result TCN outperforms traditional models in sequence modeling tasks.
Review of automatic de-identification systems for EHR, highlighting challenges beyond accuracy.
problem Challenges in surrogate generation and patient privacy in de-identification of EHR.
method Comprehensive review of 18 recently published systems, focusing on accuracy and challenges.
result Despite accuracy improvements, challenges remain in surrogate generation and patient privacy.
Bayesian methods reduce variance in subspace identification for small data sets.
problem High variance in traditional subspace identification methods for large models or small sample sizes.
method Investigation of Bayesian estimation solutions (regularized and shrinkage estimators) for subspace identification.
result Bayesian estimators reduce estimation risk by up to 40% compared to traditional methods.
Equation discovery method reconstructs model structure and parameters from data.
problem Nonlinear system identification challenges.
method Two interlaced parts: model structure identification and parameter estimation.
result Equation discovery method successfully reconstructs model structure and parameters from data.
A tutorial on non-asymptotic system identification methods.
problem Identifying system parameters in linear models.
method Covering technique, Hanson-Wright Inequality, method of self-normalized martingales.
result Streamlined proofs of least-squares based estimator performance.
A new algorithm identifies one of several nearly optimal arms in linear bandits.
problem Identifying one arm that is close to the best arm in linear bandits.
method Developed a procedure to adapt best-arm identification algorithms for ε-best-answer identification in transductive linear stochastic bandits. result Proposed an asymptotically optimal algorithm for ε-best-answer identification. Online algorithm identifies PDEs from noisy data snapshots.
problem Identifying PDEs from sequential solution snapshots.
method Combines weak-form discretization with online proximal gradient descent.
result Efficiently identifies and tracks systems with time-varying coefficients.
A distributed system identification method for LTI systems using reverse experience replay.
problem Online system identification of LTI systems over multi-agent networks.
method DSGD-RER, a distributed variant of SGD-RER with backward updates.
result The estimation error decreases as the network size grows.
Tutorial on using concentration inequalities for linear system identification.
problem Learning state-space parameters of linear systems.
method Large-deviations and self-normalized martingales.
result Data-dependent and independent bounds on learning rate.
dynoGP uses deep Gaussian processes for dynamic system identification.
problem System identification for complex dynamical systems.
method Interconnecting linear dynamic GPs and static GPs to model dynamic and static nonlinearities.
result Demonstrates effectiveness of the approach using both simulated and real-world data.
ADSGD method speeds up model identification in sparse optimization.
problem Implicit model identification in sparse optimization problems.
method Accelerated Doubly Stochastic Gradient Method (ADSGD) for faster explicit model identification.
result ADSGD achieves faster explicit model identification and improved algorithm efficiency.
Proposes SPCA to incorporate structural constraints in model identification.
problem Model identification with partial structural knowledge.
method Structural Principal Component Analysis (SPCA) that leverages structural information.
result Demonstrates improved model estimates using synthetic and industrial data.
Study shows neural networks outperform traditional methods in speaker identification.
problem Open-set speaker identification with large populations.
method Discriminative neural networks compared to Gaussian mixture models.
result Multi-class neural networks outperform traditional methods for large speaker populations.
This paper tackles Bayesian system identification with probabilistic numerical methods.
problem Accurately modeling nonlinear dynamic systems from noisy data.
method Probabilistic Sequential Monte Carlo (SMC) combined with probabilistic numerical integration.
result Efficient identification of latent states and system parameters from noisy measurements.
Study measures uncertainty in MST identification across different correlation networks.
problem Uncertainty in MST identification across various correlation-based market networks.
method Developed a framework using random variable networks (RVN) to measure uncertainty of MST identification.
result FDR is the most appropriate measure for MST identification reliability.
Paper improves phase identification in power systems using information theory.
problem Improving supervised learning accuracy in phase identification.
method Developed two new techniques based on information theory.
result Significant improvement in phase identification accuracy (e.g., from 51.7% to 97.3%).
Optimal best-arm identification in linear bandits reduces sampling budget.
problem Identifying the best arm with fixed confidence in stochastic linear bandits.
method A simple algorithm that tracks an optimal proportion of arm draws, updated as rarely as desired.
result The algorithm's sampling complexity matches known lower bounds, asymptotically almost surely and in expectation.