AutoLL uses neural networks to automatically reorder graph nodes for linear layouts.
problem Finding optimal node order in adjacency matrices without predefined features.
method Developed AutoLL-D and AutoLL-U neural network models for one-mode reordering of directed and undirected graphs.
result Demonstrated effectiveness of AutoLL through qualitative and quantitative evaluations.
Improved RBF-FD method for financial derivatives pricing.
problem Efficient pricing of financial derivatives with robust methods.
method Polyharmonic splines and smoothly varying node layouts for RBF-FD methods.
result Significantly improved performance in pricing financial derivatives.
High-order financial derivative pricing method using Radial Basis Functions.
problem Pricing financial derivatives with high accuracy and efficiency.
method Radial Basis Function generated Finite Differences for non-uniform node layouts.
result Fourth-order convergence in space with non-uniform node layouts.
Bundling of graph edges (node-to-node connections) is a common technique to enhance visibility of overall trends in the edge structure of a large graph layout, and a large variety of bundling algorithms have been proposed. However, with strong bundling, it becomes hard to identify origins and destinations of individual…
New method characterizes surface quadrilateral layouts as special immersions.
problem Characterize surface quadrilateral layouts mathematically.
method Characterizes quadrilateral layouts as special immersions of a cut representation of the surface into the Euclidean plane.
result Mathematically describes and generalizes integer grid maps.
A deep model generates diverse graph layouts.
problem Finding a good graph layout is time-consuming and haphazard.
method Deep generative model learns latent space for diverse layouts.
result Model learns and generalizes graph layout concepts.
Our recent study of a nation-wide production network uncovered a community structure, namely how firms are connected by supplier-customer links into tightly-knit groups with high density in intra-groups and with lower connectivity in inter-groups. Here we propose a method to visualize the community structure by a graph…
Spring-electrical models predict network links based on node proximity.
problem Predicting links in networks.
method Spring-electrical models applied to network layouts.
result The Euclidean distance in network layouts correlates with link probabilities.
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.
LostGANs generate realistic images from reconfigurable layouts and styles.
problem Learning generative models for realistic images from reconfigurable layouts and styles.
method End-to-end training of GANs with two new components: mask maps and ISLA-Norm.
result State-of-the-art performance on COCO-Stuff and Visual Genome datasets.
OLALA automates document layout annotation by selecting ambiguous regions for labeling.
problem Efficiently annotating complex document layouts with limited resources.
method Object-Level Active Learning framework that selects ambiguous regions for labeling and uses semi-automatic correction.
result OLALA significantly boosts model performance and improves annotation efficiency.
Stochastic gradient descent outperforms traditional force-directed methods.
problem Improving graph layout quality and efficiency.
method Applying stochastic gradient descent for stress minimization.
result Stochastic gradient descent is simpler and more robust than traditional methods.
Proposes a deep structured generative model for complex scenes.
problem Difficulty in generating images with complicated structures.
method Boosts GANs with structure information encoded by a stochastic and-or graph (sAOG).
result Successfully captures and generates images with complex structures.
Using different methods for laying out a graph can lead to very different visual appearances, with which the viewer perceives different information. Selecting a "good" layout method is thus important for visualizing a graph. The selection can be highly subjective and dependent on the given task. A common approach to se…
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.
A grid layout method for graph classification using CNNs.
problem How to project graphs onto grids for CNNs to work effectively.
method Proposes a novel graph-preserving grid layout (GPGL) using integer programming to minimize topological loss, and solves it approximately with a regularized Kamada-Kawai algorithm.
result Demonstrates the success of the method for graph classification using multi-scale maxout CNNs.
Efficient algorithm for optimizing web page layouts in real-time.
problem Optimizing web pages for conversions and click-through rates is challenging due to the large decision space and interactions between components.
method Formulated a multivariate optimization approach using bandit methodology for efficient exploration and hill-climbing for optimal selection in real-time.
result Achieved a 21% conversion increase after a single week of online optimization.
Generative model creates realistic scenes from pixel-wise labels.
problem Creating photo-realistic scenes from pixel-wise labels.
method Semantic bottleneck GAN model combining conditional and unconditional generation networks.
result Model outperforms state-of-the-art models in unsupervised image synthesis.
SPX optimizes multiple graph drawing metrics for better readability.
problem Graph drawing algorithms often optimize one metric at a time, leading to suboptimal layouts.
method Introduces Stress-Plus-X (SPX) framework that optimizes stress, crossings, angles, and upwardness simultaneously.
result SPX achieves results close to state-of-the-art algorithms that optimize metrics individually.
Browsing and finding relevant information for Bangladeshi laws is a challenge faced by all law students and researchers in Bangladesh, and by citizens who want to learn about any legal procedure. Some law archives in Bangladesh are digitized, but lack proper tools to organize the data meaningfully. We present a text vi…
Graph autoencoders enable ML across diverse sensor networks.
problem Deploying ML across different sensor networks with varying types or layouts.
method Graph Autoencoders for activity recognition across heterogeneous sensor networks.
result Transferable activity classifiers achieve 75% accuracy on unseen sensor layouts.
The paper uses network analysis to improve portfolio selection in finance.
problem Improving portfolio selection in financial markets.
method Network analysis to capture dependence structure, three methods proposed.
result Network-based portfolios are composed of peripheral assets with higher risk-reward trade-off.
Wind farm layout optimisation tackles space constraints with Bayesian multi-objective approach.
problem Optimizing wind farm layout due to limited space and conflicting objectives.
method Set-based multi-objective Bayesian optimisation using Gaussian process.
result Demonstrates potential of set-based Bayesian multi-objective optimisation for wind farm layout.
ResNet architectures improve atrial fibrillation classification.
problem Improving atrial fibrillation classification accuracy.
method Varying ResNet architecture parameters (filter count, block layout, etc.) across different model sizes.
result Similar performance across models with varying configurations, suggesting parameter dominance.
FUNSD dataset tackles noisy scanned forms, offering comprehensive annotations.
problem Extracting and structuring textual content from noisy scanned documents.
method Comprehensive dataset with real, fully annotated forms, including text detection, OCR, layout analysis, and entity linking.
result First publicly available dataset for form understanding, addressing challenges in noisy scanned documents.
This paper introduces a very challenging dataset of historic German documents and evaluates Fully Convolutional Neural Network (FCNN) based methods to locate handwritten annotations of any kind in these documents. The handwritten annotations can appear in form of underlines and text by using various writing instruments…
The paper uses deep learning to speed up spatial and visual connectivity analysis.
problem Slow calculation of spatial and visual connectivity metrics.
method Investigates machine learning models and a pipeline for training them on spatial and visual connectivity analysis.
result Deep learning models significantly speed up the analysis process.
Layout design with complex constraints is a challenging problem to solve due to the non-uniqueness of the solution and the difficulties in incorporating the constraints into the conventional optimization-based methods. In this paper, we propose a design method based on the recently developed machine learning technique,…
Researchers often summarize their work in the form of posters. Posters provide a coherent and efficient way to convey core ideas from scientific papers. Generating a good scientific poster, however, is a complex and time consuming cognitive task, since such posters need to be readable, informative, and visually aesthet…
Method reconstructs missing wind farm data using graph theory and nearest neighbors.
problem Missing data in wind farm records due to sensor failures.
method Combines spectral graph theory and k-Nearest Neighbors to estimate missing data.
result Significant improvement in data reconstruction over existing methods.
Visualizes DNNs using topographic maps for better understanding.
problem Difficulty in understanding how DNNs solve tasks.
method Adapting neuroscience methods to visualize DNN activations.
result Improved transparency and interpretability of DNN-based systems.
Proposes Continuous Graph Flow for modeling graph data.
problem Modeling complex distributions of graph-structured data.
method Generative continuous flow based on ordinary differential equations.
result Significantly better performance on diverse generation tasks.
Regularizes decision trees to reduce inference time by up to 4x with minimal accuracy loss.
problem Optimizing decision tree execution time on resource-constrained devices.
method Regularizes impurity computation during CART algorithm training to favor highly asymmetric distributions.
result Reduces inference time by up to 4x with minimal accuracy loss.
Expanding on prime knots with 6 or less mosaic tiles, this paper analyzes those with 7 tiles.
problem Determining the tile number and space-efficiency for prime knots with mosaic number 7.
method Extending the methods of Heap and Knowles (2017) to include prime knots with mosaic number 7.
result Identifying the possible tile numbers and space-efficient layouts for all prime knots with mosaic number 7.
Paper presents a self-supervised method to infer road lane networks.
problem Difficult and costly to create lane maps for autonomous vehicles.
method Self-supervised learning using neural and search-based model.
result Model can generalize to new road layouts, unlike previous approaches.
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.
We present a powerful new loss function and training scheme for learning binary hash functions. In particular, we demonstrate our method by creating for the first time a neural network that outperforms state-of-the-art Haar wavelets and color layout descriptors at the task of automated scene matching. By accurately rel…
We align distributional data using regularized Wasserstein means.
problem Aligning distributional data from different domains.
method Regularized Wasserstein means with variational transportation.
result Sparse representation captures desired properties and reduces mapping cost.
Study improves document processing in banking with multimodal analytics.
problem Raising operational efficiency in banking through document-intensive processes.
method Comparative analysis of text classifiers and multimodal model (LayoutXLM) on company register extracts.
result Incorporating layout information in a model substantially increases performance.
This paper proposes an organized generalization of Newman and Girvan's modularity measure for graph clustering. Optimized via a deterministic annealing scheme, this measure produces topologically ordered graph clusterings that lead to faithful and readable graph representations based on clustering induced graphs. Topog…
Paper proposes a machine learning framework for VLSI mask optimization.
problem Costly VLSI mask optimization due to complex processes.
method Heterogeneous OPC framework using machine learning.
result Demonstrates efficiency and effectiveness of the proposed framework.
TomOpt optimizes muon detector designs using differentiable programming.
problem Designing efficient particle detectors for muon tomography.
method Differentiable programming for muon interaction modeling, inference, and optimisation.
result Demonstrated end-to-end differentiable and inference-aware optimisation of particle physics instruments.
New method for modeling densities on Riemannian manifolds with symmetries.
problem Modeling densities on Riemannian manifolds with known symmetry groups.
method Combining implicit neural layers and optimal transport theory to propose IRCPMs.
result IRCPMs are simpler to incorporate symmetries and less expensive than ODE-flows.
Neural nets predict user attention from mouse movements.
problem Predicting user attention from mouse cursor movements.
method Investigated different mouse movement representations and trained neural networks.
result Neural networks outperform handcrafted features for predicting user attention.
Compositional Network Embedding learns node embeddings from node features.
problem Cold-start problem and lack of robustness to noise in existing network embedding methods.
method Generative framework that combines node attribute embeddings through a graph-based loss.
result Effectiveness and generalization of compositional network embeddings, especially on unseen nodes.
LC-GNN improves GNNs for node classification by incorporating label consistency.
problem Limited performance of GNNs due to label consistency assumption not always holding.
method LC-GNN uses node pairs with the same label but unconnected to expand GNN's receptive field.
result LC-GNN outperforms traditional GNNs in semi-supervised node classification.
The enumeration of normal surfaces is a key bottleneck in computational three-dimensional topology. The underlying procedure is the enumeration of admissible vertices of a high-dimensional polytope, where admissibility is a powerful but non-linear and non-convex constraint. The main results of this paper are significan…
Paper introduces Deep Node Ranking for efficient node classification and embedding.
problem Efficient node classification and embedding in complex networks.
method Autoencoder-based neural network architecture with node ranking scheme.
result Competitive or better classification performance, higher speed, and lower space requirements.