Task-guided network embedding improves author identification accuracy.
problem Identifying authors from anonymized papers in double-blind review settings.
method Task-guided and path-augmented heterogeneous network embedding model.
result Significantly better accuracy in identifying true authors compared to existing methods.
Develops a machine learning framework for identifying authorship in texts.
problem Identifying the author of texts, especially when authors are unknown or multiple.
method Formulates authorship identification as a text categorization problem, uses supervised machine learning with stylometric features.
result A model accurately predicts authorship with high accuracy, especially with linguistic stylometric features.
Authors prove Torelli theorem for a specific type of gravitational instantons.
problem Identifying diffeomorphism types of gravitational instantons.
method Using mirror special Lagrangian fibrations and recent work on rational elliptic surfaces.
result Identify 10 diffeomorphism types of ALHb∗ gravitational instantons. The goal of this research was to find a way to extend the capabilities of computers through the processing of language in a more human way, and present applications which demonstrate the power of this method. This research presents a novel approach, Rhetorical Analysis, to solving problems in Natural Language Processin…
This paper solves matrix blind joint block diagonalization with noise.
problem Identifying the diagonalizer and block diagonal structure of matrices under noise.
method Bi-block diagonalization method.
result The method can identify the exact solution under certain conditions.
Paper studies geometric properties of nonlinear Lebesgue spaces.
problem Geometric and analytic properties of nonlinear Lebesgue spaces.
method Formalizes pointwise description of geometric properties using a nonlinear Fubini-Lebesgue theorem.
result Definition of length structure, Alexandrov curvature bounds, and speed for absolutely continuous curves in nonlinear Lebesgue spaces.
Paper accelerates nonlinear mapping in online systems with lower time complexity.
problem Speeding up nonlinear mapping in online systems.
method Integrates an acceleration module into Dendrite Net (DD) to reduce time complexity.
result DD with AC has lower time complexity while maintaining nonlinear mapping and system identification properties.
For the first time ever, we analyze a unique public procurement database, which includes information about a number of bidders for a contract, a final price, an identification of a winner and an identification of a contracting authority for each of more than 40,000 public procurements in the Czech Republic between 2006…
Early classification improves satellite-based crop type identification.
problem Accurate early identification of crop types from satellite imagery.
method End-to-end trainable recurrent neural network with an additional stopping probability based on previously seen data.
result The model can distinguish crop types before the end of the vegetative period.
Regularization and Bayesian methods for system identification have been repopularized in the recent years, and proved to be competitive w.r.t. classical parametric approaches. In this paper we shall make an attempt to illustrate how the use of regularization in system identification has evolved over the years, starting…
Study tackles open-set camera model identification, improving over state-of-the-art.
problem Identifying camera models from unknown ones in open-set scenarios.
method Feature extraction algorithms and classifiers for open-set recognition, evaluating different training protocols.
result A simple open-set training protocol yields the best results, improving over state-of-the-art solutions.
New method reduces text classification errors by learning writing style instead of content.
problem Deep neural networks learn superficial patterns specific to training data.
method Adversarial training to unlearn confounding features.
result Model generalizes better and learns writing style features.
The colored Jones function of a knot is a sequence of Laurent polynomials. It was shown by TTQ. Le and the author that such sequences are q-holonomic, that is, they satisfy linear q-difference equations with coefficients Laurent polynomials in q and qn. We show from first principles that q-holonomic sequence…
Paper challenges recent methods for causal inference with multiple causes and unobserved confounders.
problem Causal inference with multiple causes and unobserved confounders.
method Analytical counterexamples and impossibility proofs.
result Nonparametric identification is impossible for causal inference with multiple causes and unobserved confounders.
ACNet improves CNNs by adaptively connecting feature nodes.
problem Improving traditional CNNs for better performance and handling non-Euclidean data.
method Adaptively connects feature nodes to switch between global and local inference.
result ACNet achieves state-of-the-art performance and overcomes limitations of MLP and CNN.
New algebraic method for knot Floer homology computation.
problem Computing knot Floer homology efficiently.
method Extending bordered Floer homology to partial knot projections and establishing a pairing result.
result Identification of knot Floer homology with its algebraic definition.
Audio fingerprinting, also named as audio hashing, has been well-known as a powerful technique to perform audio identification and synchronization. It basically involves two major steps: fingerprint (voice pattern) design and matching search. While the first step concerns the derivation of a robust and compact audio si…
Geometrically connects theta functions and WZNW blocks.
problem Identifying connections between theta functions and WZNW blocks.
method Constructing flat connections on bundles of theta functions and WZNW blocks.
result The Tsuchiya-Ueno-Yamada and Knizhnik-Zamolodchikov connections are identified.
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.
The kernel least-mean-square (KLMS) algorithm is an appealing tool for online identification of nonlinear systems due to its simplicity and robustness. In addition to choosing a reproducing kernel and setting filter parameters, designing a KLMS adaptive filter requires to select a so-called dictionary in order to get a…
This study improves child welfare risk models using clustering methods.
problem Improving predictive risk models for child maltreatment.
method Integration of PCA and K-Means clustering.
result No significant difference in model performance across clusters, but better for younger children.
There is a canonical identification, due to the author, of a convex real projective structure on an orientable surface of genus g and a pair consisting of a conformal structure together with a holomorphic cubic differential on the surface. The Deligne-Mumford compactification of the moduli space of curves then suggests…
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…
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.
Neural network de-identification improved with EHR features.
problem De-identify patient notes while preserving sensitive information.
method Incorporated human-engineered and EHR-derived features into neural networks.
result State-of-the-art de-identification improved with EHR features.
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.
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.
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.
Proves stability of Schwarzschild black holes, showing metric coefficients decay.
problem Linear stability of Schwarzschild black holes in vacuum Einstein equations.
method Linearized gravity, Hodge decomposition, gauge-invariant master quantities, decay estimates.
result Metric coefficients decay to linearized Kerr metric on exterior region.
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%).