New method for calculating crosscap numbers of knots.
problem Calculating crosscap numbers of knots efficiently.
method Deformation of plumbing and computer aid.
result Efficient calculation of crosscap numbers.
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,695 papers · 148 categories
Trend · papers per month
48 results for “computer aid”
The paper develops a causal machine learning framework to optimize aid allocation.
problem Optimizing aid allocation to reduce new HIV infections in poor countries.
method The framework uses a balancing autoencoder, counterfactual generator, and inference model to predict heterogeneous treatment effects.
result The framework predicts a reduction of up to 3.3% in new HIV infections, saving 50,000 lives.
High predictive performance and ease of use and interpretability are important requirements for the applicability of a computer-aided diagnosis (CAD) to human reading studies. We propose a CAD system specifically designed to be more comprehensible to the radiologist reviewing screening breast MRI studies. Multiparametr…
TinyLSTMs reduces speech enhancement model size and latency for hearing aids.
problem Large RNNs limit practical deployment in hearing aid hardware.
method Model compression techniques (pruning, integer quantization, state update skipping) for RNN speech enhancement.
result Reduction in model size and operations by 11.9 and 2.9, respectively, without perceptual degradation.
Deep learning aids ADMM-based decoding for binary linear codes.
problem Improving decoding efficiency for binary linear codes.
method Designing a decoding network based on ADMM and deep learning.
result Numerical results show improved performance compared to original ADMM.
Communication-Efficient Federated Hypergradient Computation via Aggregated Iterative Differentiationcs.LG
Paper proposes AggITD for efficient federated hypergradient computation.
problem Computing hypergradient in federated settings is challenging due to distributed and nonlinear construction of global Hessian matrices.
method AggITD: a novel communication-efficient federated hypergradient estimator via aggregated iterative differentiation.
result AggITD achieves the same sample complexity as AID-based approaches but with fewer communication rounds, especially in heterogeneous data environments.
Self-paced Convolutional Neural Network for Computer Aided Detection in Medical Imaging Analysiscs.CV
Tissue characterization has long been an important component of Computer Aided Diagnosis (CAD) systems for automatic lesion detection and further clinical planning. Motivated by the superior performance of deep learning methods on various computer vision problems, there has been increasing work applying deep learning t…
With the aid of a computer, we provide a motion picture of the twist-spun trefoil which exhibits the periodicity well.
A new method studies symplectic configurations in rational 4-manifolds using computer-aided techniques.
problem Understanding symplectic configurations in rational 4-manifolds.
method Computer-aided approach combining Cremona transformations and pseudoholomorphic curves.
result Nonexistence of Fano planes in the symplectic category.
The -character variety of math.GT
Authors determine the SL(2,C) character variety of a specific knot without computer aid.
problem Determine the SL(2,C) character variety of a specific knot without computational assistance.
method Develop an efficient method for working with conjugacy classes of four elements of SL(2,C).
result Determine the character variety of the knot 8_18 efficiently and software-free.
I-AID categorizes disaster tweets into useful information types.
problem Filtering useful information from social media during disasters.
method Multimodel approach using BERT, GAT, and Relation Network.
result I-AID outperforms state-of-the-art approaches in F1 scores.
Framelet Pooling Aided Deep Learning Network : The Method to Process High Dimensional Medical Datacs.LG
Machine learning-based analysis of medical images often faces several hurdles, such as the lack of training data, the curse of dimensionality problem, and the generalization issues. One of the main difficulties is that there exists computational cost problem in dealing with input data of large size matrices which repre…
This paper reviews deep learning and knowledge-based methods for molecular design.
problem Optimizing molecular properties for scientific advances and process performance.
method Survey of deep learning and knowledge-based methods for molecular design.
result Deep learning models show promise in overcoming computational challenges.
SketchGraphs dataset aids in modeling CAD designs.
problem Training models to reason about CAD designs efficiently.
method Collection of 15 million sketches with geometric constraint graphs.
result Demonstrated use cases for generative modeling and conditional generation.
Optimal model diagnoses funduscopic images for ocular diseases.
problem Binary classification of funduscopic images for ocular diseases.
method Transfer learning using Xception base architecture, Adam optimizer, mean squared error loss function, and custom heuristic equation.
result 90% accuracy, 94% sensitivity, and 86% specificity achieved.
Homological stability aids in computing group homology.
problem Computing homology of families of groups.
method Proving homological stability theorems and computing stable homology.
result Computation of Higman-Thompson groups' homology.
The paper analyzes convergence rates of bilevel optimization algorithms and introduces a new stochastic algorithm.
problem Nonconvex-strongly-convex bilevel optimization problems in machine learning.
method Comprehensive convergence rate analysis for deterministic bilevel optimization using AID and ITD, and a novel stochastic algorithm stocBiO.
result Theoretical convergence rates for AID and ITD methods, and stocBiO's superior performance.
This paper analyzes the impact of loops on bilevel optimization efficiency.
problem The impact of loops on the efficiency of bilevel optimization algorithms.
method Unified convergence analysis and computational complexity characterization for AID-BiO and ITD-BiO with and without loops.
result Loops in bilevel optimization can improve overall efficiency but increase per-step complexity.
Adversarial attacks can manipulate ML-aided visualizations, tricking analysts.
problem Adversarial attacks on ML-aided visualizations.
method Identifying attack surface and exemplifying five adversarial attacks.
result Adversaries can induce various attacks, like creating arbitrary and deceptive visualizations.
Paper explores generalization of AID-based bi-level optimization methods.
problem Uncertainty in generalization properties of AID-based bi-level optimization methods.
method Uniform stability analysis and convergence study of AID-based methods.
result AID-based methods can achieve similar generalization as single-level nonconvex problems.
A PDE approach to the existence and regularity of surfaces of minimum mean curvature variationmath.DG
Analyzes surfaces minimizing mean curvature variation using PDEs.
problem Finding surfaces of minimum mean curvature variation.
method Develops an analytic theory using partial differential equations.
result Establishes existence and regularity of minimizers.
Constructs stable bundles on K3 surfaces using monad construction.
problem Stability of bundles on K3 surfaces.
method Monad construction, Generalised Hoppe Criterion, computer aid.
result Examples of real stable bundles constructed on K3 surfaces.
Equation discovery methods enable modelers to combine domain-specific knowledge and system identification to construct models most suitable for a selected modeling task. The method described and evaluated in this paper can be used as a nonlinear system identification method for gray-box modeling. It consists of two int…
We construct an abelian quotient of the symplectic derivation Lie algebra of the free Lie algebra generated by the fundamental representation of . More specifically, we show that the weight part of the abelianization of is -dimensional for $g…
Identification of the influential clinical symptoms and laboratory features that help in the diagnosis of dengue fever in early phase of the illness would aid in designing effective public health management and virological surveillance strategies. Keeping this as our main objective we develop in this paper, a new compu…
Automated medical prognosis has gained interest as artificial intelligence evolves and the potential for computer-aided medicine becomes evident. Nevertheless, it is challenging to design an effective system that, given a patient's medical history, is able to predict probable future conditions. Previous works, mostly c…
Study efficient derivative computation for nondifferentiable maps in machine learning.
problem Efficiently compute derivatives of fixed-point of nondifferentiable contractions.
method Iterative Differentiation (ITD), Approximate Implicit Differentiation (AID), and New Stochastic Implicit Differentiation (NSID).
result Established convergence rates for ITD, AID, and NSID, matching or improving smooth setting rates.
Proof of existence of a complex structure on the six-sphere, followed by an explicit computation of its underlying integrable almost complex tensor by the aid of inner automorphisms of the octonions, is exhibited. Both are elementary and self-contained however the size and complexity of the emerging almost complex tens…
Extremal compact hyperbolic surfaces contain a packing of discs of the largest possible radius permitted by the topology of the surface. It is well known that arithmetic conditions on the uniformizing group are necessary for the existence of a second extremal packing in the same surface, but constructing explicit examp…
Computational topology is a vibrant contemporary subfield and this article integrates knot theory and mathematical visualization. Previous work on computer graphics developed a sequence of smooth knots that were shown to converge point wise to a piecewise linear (PL) approximant. This is extended to isotopic convergenc…
Approximate probabilistic inference algorithms are central to many fields. Examples include sequential Monte Carlo inference in robotics, variational inference in machine learning, and Markov chain Monte Carlo inference in statistics. A key problem faced by practitioners is measuring the accuracy of an approximate infe…
CLCNet improves noise reduction in hearing aids with deep learning.
problem Noise reduction in hearing aids is challenging due to real-time and frequency resolution constraints.
method Proposes CLCNet, a deep learning framework based on complex linear coding.
result CLCNet outperforms traditional methods in noisy environments.
This paper gives a combinatorial description of spin and spin^c-structures on triangulated PL-manifolds of arbitrary dimension. These formulations of spin and spin^c-structures are established primarily for the purpose of aiding in computations. The novelty of the approach is we rely heavily on the naturality of binary…
Computer-aided detection has been a research area attracting great interest in the past decade. Machine learning algorithms have been utilized extensively for this application as they provide a valuable second opinion to the doctors. Despite several machine learning models being available for medical imaging applicatio…
A new DVAE architecture improves channel estimation by incorporating temporal correlations.
problem Improving the estimation of time-varying channels.
method Introducing k-MemoryMarkovVAE (k-MMVAE) architecture to learn temporal correlations.
result The k-MMVAE aided channel estimator outperforms other ML aided estimators.
A new method tackles bilevel optimization using Lanczos process for efficient hyper-gradient computation.
problem Efficiently solving large-scale bilevel optimization problems with gradient-based methods.
method Constructing low-dimensional approximate Krylov subspaces with the Lanczos process to approximate the Hessian inverse vector product.
result Demonstrates a convergence rate and efficiency in synthetic and deep learning tasks.
The article confirms two quasi-alternating surgeries for 9 asymmetric L-space knots.
problem Understanding quasi-alternating surgeries on asymmetric L-space knots.
method Using the Montesinos trick to confirm known surgeries.
result Confirmation of two quasi-alternating surgeries for each of 9 asymmetric L-space knots.
We describe a calculus of moves for modifying a framed flow category without changing the associated stable homotopy type. We use this calculus to show that if two framed flow categories give rise to the same stable homotopy type of homological width at most three, then the flow categories are move equivalent. The proc…
Point cloud is the most fundamental representation of 3D geometric objects. Analyzing and processing point cloud surfaces is important in computer graphics and computer vision. However, most of the existing algorithms for surface analysis require connectivity information. Therefore, it is desirable to develop a mesh st…
AIDA designs personalized audio processing algorithms for hearing aids.
problem Improving hearing aid performance based on user feedback.
method Active inference-based agent with Bayesian trial design.
result AIDA proposes optimal alternative values for hearing aid parameters.
We propose a new algorithm for finite sum optimization which we call the curvature-aided incremental aggregated gradient (CIAG) method. Motivated by the problem of training a classifier for a d-dimensional problem, where the number of training data is and , the CIAG method seeks to accelerate increme…
Through computer enumeration with the aid of topological results, we catalogue all 18 closed non-orientable P^2-irreducible 3-manifolds that can be formed from at most eight tetrahedra. In addition we give an overview as to how the 100 resulting minimal triangulations are constructed. Observations and conjectures are d…
Surface parameterizations have been widely used in computer graphics and geometry processing. In particular, as simply-connected open surfaces are conformally equivalent to the unit disk, it is desirable to compute the disk conformal parameterizations of the surfaces. In this paper, we propose a novel algorithm for the…
In this work, we propose a subspace-based algorithm for DOA estimation which iteratively reduces the disturbance factors of the estimated data covariance matrix and incorporates prior knowledge which is gradually obtained on line. An analysis of the MSE of the reshaped data covariance matrix is carried out along with c…
Multiple modalities of biomarkers have been proved to be very sensitive in assessing the progression of Alzheimer's disease (AD), and using these modalities and machine learning algorithms, several approaches have been proposed to assist in the early diagnosis of AD. Among the recent investigated state-of-the-art appro…
New models suggest molecules that are often unfeasible to synthesize.
problem Models suggest molecules that are difficult to synthesize.
method Used a computer-aided synthesis planning program to analyze synthesizability of molecules generated by state-of-the-art models.
result State-of-the-art models generate molecules that are often unfeasible to synthesize.
Orthogonal frequency division multiplexing (OFDM) has been widely applied in current communication systems. The artificial intelligence (AI)-aided OFDM receivers are currently brought to the forefront to replace and improve the traditional OFDM receivers. In this study, we first compare two AI-aided OFDM receivers, nam…
Learning-based Computer-aided Prescription Model for Parkinson's Disease: A Data-driven Perspectivecs.LG
A model learns symptom-drug relations for PD patients.
problem Automatic prescription recommendation for Parkinson's Disease patients.
method Builds a dataset of PD symptoms and prescriptions, learns latent symptom space, uses alternating optimization.
result Effective in recommending suitable prescription drugs for new PD patients.